Abstract
We consider tissue P systems with antiport rules and investigate their computational power when using only a (very) small number of symbols and cells. Even when using only one symbol, any recursively enumerable set of natural numbers can be generated with at most seven cells. On the other hand, with only one cell we can only generate regular sets when using one channel with the environment, whereas one cell with two channels between the cell and the environment obtains computational completeness with at most five symbols. Between these extreme cases of one symbol and one cell, respectively, there seems to be a trade-off between the number of cells and the number of symbols, e.g., for the case of tissue P systems with two channels between a cell and the environment we show that computational completeness can be obtained with two cells and three symbols as well as with three cells and two symbols, respectively.
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.
References
Alhazov, A., Freund, R.: P systems with one membrane and symport/ antiport rules of five symbols are computationally complete. To appear in the Proceedings of the Third Brainstorming Week on Membrane Computing, Sevilla (2005)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Freund, R., Oswald, M.: P Systems with activated/prohibited membrane channels. In: [14], pp. 261–268 (2003)
Freund, R., Oswald, M.: Tissue P systems with symport / antiport rules of one symbol are computationally complete. In: Downloadable from [16] (2004)
Freund, R., Păun, A.: Membrane systems with symport/ antiport rules: universality results. In: [14], pp. 270–287 (2003)
Freund, R.: Păun, Gh., Pérez-Jiménez, M.J.: Tissue-like P systems with channel states. Second Brainstorming Week on Membrane Computing, Sevilla, February 2004, TR 01/04 of Research Group on Natural Computing, Sevilla University, pp. 206–223 (2004); Theoretical Computer Science 330, 101–116 (2005)
Frisco, P., Hoogeboom, H.J.: Simulating counter automata by P systems with symport/antiport. In: [14], pp. 288–301 (2003)
Martín-Vide, C., Pazos, J., Păun, G., Rodríguez-Patón, A.: Tissue P systems. Theoretical Computer Science 296(2), 295–326 (2003)
Minsky, M.L.: Computation: 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); TUCS Research Report 208 (1998), http://www.tucs.fi
Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)
Păun, G., Pazos, J., Pérez-Jiménez, M.J., Rodríguez-Patón, A.: Symport/ antiport P systems with three objects are universal. In: Downloadable from [16] (2004)
Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.): WMC 2002. LNCS, vol. 2597. Springer, Heidelberg (2003)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages (3 volumes). Springer, Berlin (1997)
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
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alhazov, A., Freund, R., Oswald, M. (2005). Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_9
Download citation
DOI: https://doi.org/10.1007/11505877_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26546-7
Online ISBN: 978-3-540-31682-4
eBook Packages: Computer ScienceComputer Science (R0)