Buscar
Mostrando ítems 1-2 de 2
Artículo
P automata revisited
(Elsevier, 2012)
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 ...
Artículo
An infinite hierarchy of languages defined by dP systems
(Elsevier, 2012)
Here, we continue the study of the recently introduced dP automata. They are symport/antiport P systems consisting of a number of components, each one accepting a string, and working together in recognizing the concatenation ...