Add to ORKGWe 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
We continue here the investigation of P automata, in their non-extended case, a class of devices wh...
AbstractThe algorithm we present here generates finite-state automata for potentially unbounded exam...
The class of context-free grammars that can be deterministically parsed in a top down manner with a ...
In this paper a subclass of generalized P colony automata is defined that satisfies a property which...
We study the computational power of generalized P colony automata and show how it is in uenced by ...
In this paper we introduce and study P colonies where the environment is given as a string. These v...
In this paper we study P colonies where the environment is given as a string. These variants, calle...
We introduce the concept of a P colony automaton, an automata-like con- struct combining properties...
In this paper we continue our investigations in APCol systems (Automatonlike P colonies), variants ...
We investigate genPCol automata with input mappings that can be realized through the application of ...
We introduce a new acceptance mode for APCol systems (Automaton-like P colonies), variants of P col...
We study the computational power of generalized P colony automata and show how it is influenced by t...
We show how P automata having a finite description and working with a finite object-alphabet can be...
A context-sensitive grammar G is said to be CS(k) iff a particular kind of table-driven parser, Tk(G...
P automata are accepting computing devices combining features of classical automata and membrane sys...
We continue here the investigation of P automata, in their non-extended case, a class of devices wh...
AbstractThe algorithm we present here generates finite-state automata for potentially unbounded exam...
The class of context-free grammars that can be deterministically parsed in a top down manner with a ...
In this paper a subclass of generalized P colony automata is defined that satisfies a property which...
We study the computational power of generalized P colony automata and show how it is in uenced by ...
In this paper we introduce and study P colonies where the environment is given as a string. These v...
In this paper we study P colonies where the environment is given as a string. These variants, calle...
We introduce the concept of a P colony automaton, an automata-like con- struct combining properties...
In this paper we continue our investigations in APCol systems (Automatonlike P colonies), variants ...
We investigate genPCol automata with input mappings that can be realized through the application of ...
We introduce a new acceptance mode for APCol systems (Automaton-like P colonies), variants of P col...
We study the computational power of generalized P colony automata and show how it is influenced by t...
We show how P automata having a finite description and working with a finite object-alphabet can be...
A context-sensitive grammar G is said to be CS(k) iff a particular kind of table-driven parser, Tk(G...
P automata are accepting computing devices combining features of classical automata and membrane sys...
We continue here the investigation of P automata, in their non-extended case, a class of devices wh...
AbstractThe algorithm we present here generates finite-state automata for potentially unbounded exam...
The class of context-free grammars that can be deterministically parsed in a top down manner with a ...