Buscar
Mostrando ítems 1-5 de 5
Ponencia
A Class of P Automata for Characterizing Context-free Languages
(Fénix Editora, 2006)
We present a characterization of context-free languages in terms of a restricted class of P automata (P systems accepting strings of symbols using symport/antiport communication rules). The characterization is based on the ...
Ponencia
On Very Simple P Colonies
(Fénix Editora, 2009)
We study two very simple variants of P colonies: systems with only one object inside the cells, and systems with insertion-deletion programs, so called P colonies with senders and consumers. We show that both of these ...
Ponencia
On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
(Fénix Editora, 2005)
We show how P automata having a finite description and working with a finite object-alphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized ...
Ponencia
Small Computationally Complete Symport/Antiport P Systems
(Fénix Editora, 2006)
It is known that P systems with symport/antiport rules simulate the register machines, i.e., they are computationally complete. Hence, due to the existence of universal register machines, there exist computationally ...
Ponencia
Editing Configurations of P Systems
(Fénix Editora, 2005)
This paper proposes and preliminarily investigates the possibility of transforming a configuration (membrane structure and multisets of symbol-objects present in the compartments of this membrane structure) of a P system ...