Presentation
P Colony Automata with LL(k)-like Conditions
Author/s | Csuhaj Varjú, Erzsébet
Kántor, Kristóf Vaszil, György |
Publication Date | 2018 |
Deposit Date | 2019-03-07 |
Published in |
|
Abstract | We investigate the possibility of the deterministic parsing (that is, parsing
without backtracking) of languages characterized by (generalized) P colony automata.
We de ne a class of P colony automata satisfying a property ... We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages characterized by (generalized) P colony automata. We de ne a class of P colony automata 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. |
Citation | Csuhaj Varjú, E., Kántor, K. y Vaszil, G. (2018). P Colony Automata with LL(k)-like Conditions. En BWMC 2018: Sixteenth Brainstorming Week on Membrane Computing (69-78), Sevilla, España: Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática. |
Files | Size | Format | View | Description |
---|---|---|---|---|
069_PColony.pdf | 87.96Kb | [PDF] | View/ | |