Formal languages
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Membrane Computing: An Introduction
Membrane Computing: An Introduction
P Automata or Purely Communicating Accepting P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On the Computational Complexity of P Automata
Natural Computing: an international journal
New Generation Computing
P finite automata and regular languages over countably infinite alphabets
WMC'06 Proceedings of the 7th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
An infinite hierarchy of languages defined by dP systems
Theoretical Computer Science
Finite dp automata versus multi-head finite automata
CMC'11 Proceedings of the 12th international conference on Membrane Computing
| Hi-index | 5.23 |
We continue here the investigation of P automata, in their non-extended case, a class of devices which characterize non-universal family of languages. First, a recent conjecture is confirmed: any recursively enumerable language is obtained from a language recognized by a P automaton, to which an initial (arbitrarily large) string is added. Then, we discuss possibilities of extending P automata, following suggestions from string finite automata. For instance, automata with a memory (corresponding to push-down automata) are considered and their power is briefly investigated, as well as some closure properties of the family of languages recognized by P automata. In the context, a brief survey of results about P and dP automata (a distributed version of P automata) is provided, and several further research topics are formulated.