Repositorio de producción científica de la Universidad de Sevilla

P Colony Automata with LL(k)-like Conditions

 

Advanced Search
 
Opened Access P Colony Automata with LL(k)-like Conditions
Cites
Show item statistics
Icon
Export to
Author: Csuhaj Varjú, Erzsébet
Kántor, Kristóf
Vaszil, György
Date: 2018
Published in: BWMC 2018: Sixteenth Brainstorming Week on Membrane Computing (2018), p 69-78
Document type: Presentation
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 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.
Cite: 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.
Size: 87.96Kb
Format: PDF

URI: https://hdl.handle.net/11441/83916

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)