Cell/symbol complexity of tissue P systems with symport/antiport rules

International Journal of Foundations of Computer Science

Volumn 17, Issue 1, 2006, Pages 3-25

  Alhazov, Artiom ^a,b   Freund, Rudolf ^c   Oswald, Marion ^c  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^b INSTITUTE OF MATHEMATICS AND COMPUTER SCIENCE   (Moldova)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Antiport rules; Cells; Descriptional complexity; Membrane computing; Tissue P systems; Universality

Indexed keywords

EID: 33746214564     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S012905410600367X     Document Type: Article

References (22)

1. A. Alhazov, R. Freund, P systems with one membrane and symport/antiport rules of five symbols are computationally complete. In Proceedings of the Third Brainstorming Week on Membrane Computing (M.A. Gutiérrez-Naranjo, A, Riscos-Núñez, F.J. Romero-Campero, D. Sburlan, eds.), Fenix Editora, Sevilla, 2005, 19-28.
2. A. Alhazov, R. Freund, M. Oswald, Tissue P systems with antiport rules and a small number of symbols and cells. In Developments in Language Theory, DLT 8005, Palermo (C. De Felice, A. Restivo, eds.), LNCS 3572, Springer-Verlag, Berlin, 2005, 100-111.
3. A. Alhazov, R. Freund, M. Oswald, Membrane/symbol complexity of P systems symport/antiport rules. In Pre-proceedings of Workshop on Membrane Computing, WMC6, Vienna, 2005.
4. J. Dassow, Gh. Pǎun, Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin, 1989.
5. R. Freund, A. Leporati, M. Oswald, C. Zandron, Sequential P systems with unit rules and energy assigned to membranes. In Machines, Computations, and Universality, MCU 2004, Saint Petersburg (M. Margenstern, ed.), LNCS 3354, Springer-Verlag, Berlin, 2004, 200-210.
6. R. Freund, M. Oswald, P Systems with activated/prohibited membrane channels. In [18], 261-268.
7. R. Freund, M. Oswald, Tissue P systems with symport/antiport rules of one symbol are computationally complete. Downloadable from [20], 2004.
8. R. Freund, A. Pǎun, Membrane systems with symport/antiport rules: universality results. In [18], 270-287.
9. R. Freund, Gh. Pǎun, M.J. Pérez-Jiménez, Tissue-like P systems with channel states. In Second Brainstorming Week on Membrane Computing, Sevilla, February 2004, TR 01/04 of Research Group on Natural Computing, Sevilla University, 2004, 206-223,
10. and Theoretical Computer Science, 330 (2005), 101-116.
11. P. Frisco, H.J. Hoogeboom, Simulating counter automata by P systems with symport/antiport. In [18], 288-301.
12. D. Hauschildt, M. Jantzen, Petri net algorithms in the theory of matrix grammars. Acta Informatica, 31 (1994), 719-728.
13. C. Martín-Vide, J. Pǎzos, Gh. Pǎun, A Rodríguez-Patón, Tissue P systems. Theoretical Computer Science, 296, 2 (2003), 295-326.
14. M.L. Minsky, Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey, 1967.
15. A. Pǎun, Gh. Pǎun, The power of communication: P systems with symport/antiport. New Generation Computing, 20, 3 (2002), 295-306.
16. Gh. Pǎun, Computing with membranes. Journal of Computer and System Sciences, 61, 1 (2000), 108-143,
17. and TUCS Research Report 208 (1998) (http://www.tucs.fi).
18. Gh. Pǎun, Membrane Computing: An Introduction. Springer-Verlag, Berlin, 2002.
19. Gh. Pǎun, J. Pazos, M.J. Pérez-Jiménez, A. Rodríguez-Patón, Symport/antiport P systems with three objects are universal. Fundamenta Informaticae, 64, 1-4 (2005), 353-367.
20. Gh. Pǎun, G. Rozenberg, A. Salomaa, C. Zandron, eds., Membrane Computing. International Workshop WMC 2002, Curtea de Argeş, Romania, Revised Papers. LNCS 2597, Springer-Verlag, Berlin, 2003.
21. G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages (3 volumes). Springer-Verlag, Berlin, 1997.
22. The P Systems Web Page: http://psystems.disco.unimib.it.