Abstract
We introduce ω -P automata based on the model of P systems with membrane channels (see [8]) using only communication rules. We show that ω -P automata with only two membranes can simulate the computational power of usual (non-deterministic) ω -Turing machines. A very restricted variant of ω -P automata allows for the simulation of ω -finite automata in only one membrane.
This is a preview of subscription content, log in via an institution to check access.
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
Cohen, R.S., Gold, A.Y.: ω-computations on Turing machines. Theoretical Computer Science 6, 1–23 (1978)
Cohen, R.S., Gold, A.Y.: On the complexity of ω-type Turing acceptors. Theoretical Computer Science 10, 249–272 (1980)
Csuhaj-Varjú, E., Vaszil, G.: P automata or purely communicating accepting P systems. In: [15], pp. 219–233
Dassow, J., Păun, G.: On the power of membrane computing. Journal of Universal Computer Science 5(2), 33–49 (1999), http://www.iicm.edu/jucs
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Engelfriet, J., Hoogeboom, H.J.: X-automata on ω-words. Theoretical Computer Science 110(1), 1–51 (1993)
Freund, R., Oswald, M.: A short note on analysing P systems with antiport rules. EATCS Bulletin 78, 231–236 (2002)
Freund, R., Oswald, M.: P systems with activated/prohibited membrane channels. In: [15], pp. 261–269
Freund, R.: On the number of non-terminals in graph-controlled, programmed, and matrix grammars. In: Margenstern, M., Rogozhin, Y. (eds.) Proc. Conf. Universal Machines and Computations, Chişinău. Springer, Berlin (2001)
Minsky, M.L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
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. Journal of Computer and System Sciences 61(1), 108–143 (2000), http://www.tucs.fi ; and TUCS Research Report 208 (1998)
Păun, G.: Computing with membranes: an introduction. Bulletin EATCS 67, 139–152 (1999)
Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)
Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing 2002. LNCS, vol. 2597. Springer, Heidelberg (2002)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Staiger, L.: ω-languages. In: [16], vol. 3, pp. 339–387
Wagner, K., Staiger, L.: Recursive ω-languages. In: Karpinski, M. (ed.) FCT 1977. LNCS, vol. 56, pp. 532–537. Springer, Heidelberg (1977)
The P Systems Web Page, http://psystems.disco.unimib.it
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freund, R., Oswald, M., Staiger, L. (2004). ω -P Automata with Communication Rules. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2003. Lecture Notes in Computer Science, vol 2933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24619-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24619-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20895-2
Online ISBN: 978-3-540-24619-0
eBook Packages: Springer Book Archive