Deterministic parsing with P colony automata

Erzsébet Csuhaj-Varjú, Kristóf Kántor, György Vaszil

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages described by (generalized) P colony automata. We define a subclass of these computing devices satisfying a property which resembles the LL(k) property of context-free grammars, and study the possibility of parsing the characterized languages using a k symbol lookahead, as in the LL(k) parsing method for context-free languages.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages88-98
Number of pages11
DOIs
Publication statusPublished - Jan 1 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11270 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Deterministic parsing with P colony automata'. Together they form a unique fingerprint.

  • Cite this

    Csuhaj-Varjú, E., Kántor, K., & Vaszil, G. (2018). Deterministic parsing with P colony automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 88-98). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11270 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-00265-7_8