Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems

Theoretical Computer Science

Volumn 358, Issue 1, 2006, Pages 88-103

  Ibarra, Oscar H ^a   Pǎun, Gheorghe ^b,c  

^a University of California   (United States)

^b INSTITUTE OF MATHEMATICS   (Romania)

^c UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Context sensitive language; Linear bounded automaton; One way log n space bounded turing machine; Symport antiport P system; Two way multihead finite automaton

Indexed keywords

COMPUTATIONAL METHODS; ITERATIVE METHODS; PARAMETER ESTIMATION; SET THEORY; SYNTACTICS;

CONTEXT-SENSITIVE LANGUAGE; LINEAR-BOUNDED AUTOMATON; ONE-WAY LOG N SPACE-BOUNDED TURING MACHINE; SYMPORT/ANTIPORT P SYSTEM; TWO-WAY MULTIHEAD FINITE AUTOMATON;

COMPUTER SCIENCE;

EID: 33746027898     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.03.003     Document Type: Article

References (21)

1. Alhazov A., Freund R., and Oswald M. Symbol/membrane complexity of P systems with symport/antiport rules. In: Freund R., Lojka G., Oswald M., and Pǎun Gh. (Eds). Pre-Proc. Sixth Internat. Workshop on Membrane Computing, WMC6 (2005), Vienna Technological University 123-146
2. Alhazov A., Freund R., and Rogozhin Y. Computational power of symport/ antiport: history, advances, and open problems. In: Freund R., Lojka G., Oswald M., and Pǎun Gh. (Eds). Pre-Proc. Sixth Internat. Workshop on Membrane Computing, WMC6 (2005), Vienna Technological University 44-78
3. G. Bel-Enguix, M. Cavaliere, R. Ceterchi, C. Martin-Vide, An application of dynamic P systems: generating context-free languages, in: Gh. Pǎun, G. Rozenberg, A. Salomaa, C. Zandron (Eds.), Membrane Computing. International Workshop, WMC-CdeA 2002, Curtea de Argeş, Romania, Revised Papers, Lecture Notes in Computer Science, Vol. 2597, Springer, Berlin, 2003, pp. 90-106.
4. E. Csuhaj-Varju, O.H. Ibarra, G. Vaszil, On the computational complexity of P automata, in: C. Ferretti, G. Mauri, C. Zandron (Eds.), Proc. of DNA10 Conference, Milano, 2004, Lecture Notes in Computer Science, Vol. 3384, Springer, Berlin, 2005, pp. 76-89.
5. R. Freund, Gh. Pǎun, On deterministic P systems, Available at the P Systems Web Page: http://psystems.disco.unimib.it, 2003.
6. Ibarra O.H. A hierarchy theorem for polynomial space recognition. SIAM J. Comput. 3 (1974) 184-187
7. O.H. Ibarra, The number of membranes matters, in: Membrane Computing. International Workshop, WMC2003, Tarragona, Lecture Notes in Computer Science, Vol. 2933, Springer, Berlin, 2004, 218-231. Theoret. Comput. Sci. 2005, to appear.
8. O.H. Ibarra, On determinism versus non-determinism in P systems, Theoret. Comput. Sci., 2005, to appear.
9. O.H. Ibarra, S. Woodworth, On bounded symport/antiport P systems, Pre-Proc. 11th Internat. Meeting on DNA Computing, UWO, London, Ontario, 2005, pp. 37-48.
10. Immerman N. Non-deterministic space is closed under complementation. SIAM J. Comput. 17 5 (1988) 935-938
11. Minsky M. Computation-Finite and Infinite Machines (1967), Prentice-Hall, Englewood Cliffs, NJ
12. Pǎun A., and Pǎun Gh. The power of communication: P systems with symport/antiport. New Generation Comput. 20 3 (2002) 295-306
13. Pǎun Gh. Computing with membranes. J. Comput. System Sci. 61 1 (2000) 108-143
14. Pǎun Gh. Membrane Computing: An Introduction (2002), Springer, Berlin
15. Pǎun Gh., Pazos J., Pérez-Jiménez M.J., and Rodriguez-Paton A. Symport/ antiport P systems with three objects are universal. Fund. Inform. 64 1-4 (2005) 353-367
16. Pǎun Gh., and Rozenberg G. A guide to membrane computing. Theoret. Comput. Sci. 287 1 (2002) 73-100
17. Pǎun G., Rozenberg G., and Salomaa A. DNA computing, New Computing Paradigms (1998), Springer, Berlin
18. Savitch W. A note on multihead automata and context-sensitive languages. Acta Inform. 2 (1973) 249-252
19. P. Sosik, P systems versus register machines: two universality proofs, in: Pre-Proc. of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Argeş, Romania, 2002, pp. 371-382.
20. Szelepcsényi R. The method of forced enumeration for nondeterministic automata. Acta Inform. 26 3 (1988) 279-284
21. The P Systems Web Page: http://psystems.disco.unimib.it.