On the Computational Complexity of P Automata
We characterize the classes of languages described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, we study computational complexity classes with a certain restriction on the use of the available workspace in the course of computations and relate these to the language classes described by P automata. We prove that if the rules of the P system are applied sequentially, then the accepted language class is strictly included in the class of languages accepted by one-way Turing machines with a logarithmically bounded workspace, and if the rules are applied in the maximal parallel manner, then the class of context-sensitive languages is obtained.
KeywordsTuring Machine Mathematical Linguistics Rule Application Input Symbol Input Tape
Unable to display preview. Download preview PDF.
- 5.Ibarra, O.H.: On the Computational Complexity of Membrane Systems. Theoretical Computer Science C (to appear)Google Scholar
- 6.Ibarra, O.H.: The Number of Membranes Matters. In: Alhazov, A., Martín-Vide, C., Păun, Gh. (eds.): Workshop on Membrane Computing, WMC-2003, Tarragona, July 17-22, Technical Report 28/03 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain, 273-285 (2003)Google Scholar
- 7.Madhu, M., Krithivasan, K.: On a Class of P Automata (submitted)Google Scholar
- 10.Păun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)Google Scholar