Abstract
We characterize the classes of languages over finite alphabets which may be described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, and the actual behavior of P automata, 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 maximally parallel manner, then the class of context-sensitive languages is obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Csuhaj-Varjú E and Vaszil Gy (2002) P Automata. In: Păun Gh and Zandron C (eds) Pre-Proceedings of the Workshop on Membrane Computing WMC-CdeA 2002, Curtea de Argeş, Romania, August 19-23, 2002, pp. 177–192. Pub. No. 1 of MolCoNet-IST-2001–32008. See also as
E Csuhaj-Varjú Gy Vaszil (2003) P Automata or purely communicating accepting P systems Gh Păun G Rozenberg A Salomaa C Zandron (Eds) Membrane Computing Lecture Notes in Computer Science NumberInSeriesVol. 2597 Springer Berlin 219–233
PC Fischer (1966) ArticleTitleTuring machines with restricted memory access Information and Control 9 364–379 Occurrence Handle0145.24205 Occurrence Handle199061 Occurrence Handle10.1016/S0019-9958(66)80003-7
Freund R, Martín-Vide C, Obtułowicz A and Păun Gh (2003) On three classes of automata-like P systems. In: Ésik Z and Fülöp Z (eds) Developments in Language Theory. 7th International Conference, DLT 2003, Szeged, Hungary, July 2003. Proceedings. Lecture Notes in Computer Science, Vol. 2710, pp. 292–303. Springer, Berlin
R Freund M Oswald (2002) ArticleTitleA short note on analysing P systems Bulletin of the EATCS 78 IssueIDOctober 231–236 Occurrence Handle1964509
Ibarra OH (2003) The number of membranes matters. In: Alhazov A, Martín-Vide C and Păun Gh (eds) Workshop on Membrane Computing, WMC-2003, Tarragona, July 17–22, 2003, pp. 273–285. Technical Report 28/03 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain
OH Ibarra (2004) ArticleTitleOn the computational complexity of membrane systems Theoretical Computer Science 320 IssueID1 89–109 Occurrence Handle1068.68060 Occurrence Handle2060184 Occurrence Handle10.1016/j.tcs.2004.03.045
M Madhu K Krithivasan (2003) ArticleTitleOn a class of P automata International Journal of Computer Mathematics 80 IssueID9 1111–1120 Occurrence Handle2008426 Occurrence Handle10.1080/0020716031000148502 Occurrence Handle1091.68067
C Martín-Vide A Păun Gh Păun (2002) ArticleTitleOn the power of P systems with symport rules Journal of Universal Computer Science 8 IssueID2 317–331 Occurrence Handle1895807
A Păun Gh Păun (2002) ArticleTitleThe power of communication: P systems with symport/antiport New Generation Computing 20 IssueID3 295–306 Occurrence Handle10.1007/BF03037362 Occurrence Handle1024.68037
Gh Păun (2002) Membrane Computing: An Introduction Springer Berlin Occurrence Handle1034.68037
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Csuhaj-Varjú, E., Ibarra, O.H. & Vaszil, G. On the Computational Complexity of P Automata. Nat Comput 5, 109–126 (2006). https://doi.org/10.1007/s11047-005-4461-1
Issue Date:
DOI: https://doi.org/10.1007/s11047-005-4461-1