%0 Generic
%D 2011
%T dP automata versus right-linear simple matrix grammars
%A Gheorghe Paun
%A Mario J. Pérez-Jiménez
%C Seville, Spain
%I Fénix Editora
%P 293-304
%S Proceedings of the Ninth Brainstorming Week on Membrane Computing
%U http://www.gcn.us.es/9BWMC/volume/21dPsystemsCris.pdf
%X We consider dP automata with the input string distributed in an arbitrary (hence not necessary balanced) way, and we investigate their language accepting power, both in the case when a bound there is on the number of objects present inside the system and in the general case. The relation with right-linear simple matrix grammars is useful in this respect. Some research topics and open problems are also formulated.
%8 02/2011