On the Power of P Automata
We study the computational power of P automata, variants of symport/antiport P systems which characterize string languages by applying a mapping to the sequence of multisets entering the system during computations. We consider the case when the input mapping is defined in such a way that it maps a multiset to the set of strings consisting of all permutations of its elements. We show that the computational power of this type of P automata is strictly less than so called restricted logarithmic space Turing machines, and we also exhibit a strict infinite hierarchy within the accepted language class based on the number of membranes present in the system.
Unable to display preview. Download preview PDF.
- 2.Csuhaj-Varjú, E., Oswald, M., Vaszil, G.: P automata. In: , ch. 6, pp. 144–167Google Scholar
- 5.Freund, R., Kogler, M., Păun, G., Pérez-Jiménez, M.J.: On the power of P and dP automata. Annals of Bucharest University Mathematics-Informatics Series LVIII, 5–22 (2009)Google Scholar
- 9.Păun, G., Pérez-Jiménez, M.J.: Solving problems in a distributed way in membrane computing: dP systems. International Journal of Computers, Communication and Control V(2), 238–250 (2010)Google Scholar
- 10.Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press (2010)Google Scholar