Abstract
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.
The research of E. Csuhaj-Varjú and Gy. Vaszil was supported in part by the Hungarian Scientific Research Fund “OTKA” grant no. T 042529. The research of O. H. Ibarra was supported in part by NSF Grants IIS-0101134 and CCR02-08595.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Csuhaj-Varjú, E., Vaszil, G.: P Automata. In: Păun, G., et al. (eds.) WMC 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)
Fischer, P.C.: Turing Machines with Restricted Memory Access. Information and Control 9, 364–379 (1966)
Freund, R., Martín-Vide, C., Obtułowicz, A., Păun, G.: On Three Classes of Automata-like P Systems. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 292–303. Springer, Heidelberg (2003)
Freund, R., Oswald, M.: A Short Note on Analysing P Systems. Bulletin of the EATCS 78, 231–236 (2002)
Ibarra, O.H.: On the Computational Complexity of Membrane Systems. Theoretical Computer Science C (to appear)
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)
Madhu, M., Krithivasan, K.: On a Class of P Automata (submitted)
Martín-Vide, C., Păun, A., Păun, G.: On the Power of P Systems with Symport Rules. Journal of Universal Computer Science 8(2), 317–331 (2002)
Păun, A., Păun, G.: The Power of Communication: P Systems with Symport/Antiport. New Generation Computing 20(3), 295–306 (2002)
Păun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1-3. Springer, Berlin (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G. (2005). On the Computational Complexity of P Automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_7
Download citation
DOI: https://doi.org/10.1007/11493785_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)