From regulated rewriting to computing with membranes: Collapsing hierarchies

Theoretical Computer Science

Volumn 312, Issue 2-3, 2004, Pages 143-188

  Freund, Rudolf ^a   Martín Vide, Carlos ^b   Paun, Gheorghe ^c  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^c INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

Graph controlled grammar; Matrix grammar; Membrane computing; Non terminal complexity; P system; Programmed grammar; Recursively enumerable language; Register machine; Regulated rewriting

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONTEXT FREE GRAMMARS; FUNCTIONS; GRAPHIC METHODS; HIERARCHICAL SYSTEMS; MACHINE COMPONENTS; PROGRAMMING THEORY;

GRAPH-CONTROLLED GRAMMAR; MATRIX GRAMMAR; MEMBRANE COMPUTING; NON-TERMINAL COMPLEXITY; PROGRAMMED GRAMMAR; RECURSIVELY ENUMERABLE LANGUAGES; REGISTER MACHINES; REGULATED REWRITING;

COMPUTER SCIENCE;

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

References (36)

1. Abraham S. Some questions of phrase-structure grammars. Comput. Linguist. 4:1965;61-70.
2. Calude C., Paun Gh. Computing with membranes, Computing with Cells and Atoms. 2000;Taylor & Francis, London. (Chapter 3).
3. Dassow J., Paun Gh. Regulated Rewriting in Formal Language Theory. 1989;Springer, Berlin.
4. Fernau H. Nonterminal complexity of programmed grammars. Margenstern M., Rogzhin Y. Machines, Computations and Universality, 3rd Internat. Conf., MCU 2001. Lecture Notes in Computer Science. Vol. 2055:2001;202-213 Springer, Berlin.
5. Freund R. Generalized P-systems with splicing and cutting/recombination. Grammars. 2(3):1999;189-199.
6. R. Freund, F. Freund, Molecular computing with generalized homogeneous P systems, in: A. Condon, G. Rozenberg (Eds.), Proc. Conf. DNA 6, Leiden, 2000, pp. 113-125.
7. Freund R., Paun Gh. On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. Margenstern M., Rogzhin Y. Machines, Computations and Universality, 3rd Internat. Conf., MCU 2001. Lecture Notes in Computer Science. Vol. 2055:2001;214-225 Springer, Berlin.
8. P. Frisco, Membrane computing based on splicing: improvements, Workshop on Multiset Processing, Curtea de Argeş, Romania, 2000, in: C.S. Calude, M.J. Dinneen, Gh. Paun (Eds.), CDMTCS Report no. 140, University of Auckland, 2000, pp. 100-111.
9. Greibach S. Remarks on blind and partially blind one-way multicounter machines. Theoret. Comput. Sci. 7:1978;311-324.
10. J. Gruska, Descriptional complexity of context-free languages, Proc. Math. Found. Comput. Sci. Conf., High Tatras, 1973, pp. 71-83.
11. Hauschild D., Jantzen M. Petri nets algorithms in the theory of matrix grammars. Acta Inform. 31:1994;719-728.
12. Krishna S.N., Rama R. A variant of P systems with active membranes. solving NP-complete problems Romanian J. Inform. Sci. Technol. 2(4):1999;357-367.
13. Krishna S.N., Rama R. On the power of P systems with sequential and parallel rewriting. Internat. J. Comput. Math. 77(1-2):2000;1-14.
14. C. Martin-Vide, Gh. Paun, String objects in P systems, Proc. Algebraic Systems, Formal Languages and Computations Workshop, Kyoto, 2000, RIMS Kokyuroku, Kyoto University, 2000, pp. 161-169.
15. Minsky M.L. Computation: Finite and Infinite Machines. 1967;Prentice-Hall, Englewood Cliffs, NJ.
16. Obtulowicz A. Membrane computing and one-way functions. Internat. J. Found. Comput. Sci. 12(4):2001;551-558.
17. Paun Gh. Six nonterminals are enough for generating each r.e. language by a matrix grammar. Internat. J. Comput. Math. 15:1984;23-37.
18. Paun A. On P systems with membrane division. Antoniou I., Calude C.S., Dinneen M.J. Proc. 2nd Conf. Unconventional Models of Computation. 2000;187-201 Springer, Berlin.
19. Paun Gh. Computing with membranes. J. Comput. System Sci. 61(1):2000;108-143. (and Turku Center for Computer Science-TUCS Report No. 208, 1998, www.tucs.fi).
20. Paun Gh. Computing with membranes. J. Comput. System Sci. 61(1):2000;108-143. (and Turku Center for Computer Science-TUCS Report No. 208, 1998, www.tucs.fi).
21. Paun Gh. Computing with membranes - a variant. P systems with polarized membranes Internat. J. Found. Comput. Sci. 11(1):2000;167-182.
22. Paun Gh. Computing with membranes: attacking NP-complete problems. Antoniou I., Calude C.S., Dinneen M.J. Proc. 2nd Conf. Unconventional Models of Computation. 2000;94-115 Springer, London.
23. Paun Gh. P systems with active membranes. attacking NP complete problems J. Automat. Languages Combin. 6(1):2001;75-90.
24. Paun A., Paun M. On the membrane computing based on splicing. Martin-Vide C., Mitrana V. Where Mathematics, Computer Science, Linguistics, and Biology Meet. 2001;409-422 Kluwer, Dordrecht.
25. Paun Gh., Rozenberg G., Salomaa A. DNA Computing. New Computing Paradigms. 1998;Springer, Berlin.
26. Paun Gh., Rozenberg G., Salomaa A. Membrane computing with external output. Fund. Informat. 41(3):2000;259-266.
27. Gh. Paun, Y. Suzuki, H. Tanaka, T. Yokomori, On the power of membrane division in P systems, Theoret. Comput. Sci., to appear.
28. Paun Gh., Yokomori T. Membrane computing based on splicing. Winfree E., Gifford D. Preliminary Proc. of 5th Internat. Meeting on DNA Based Computers. June 1999;213-227 MIT, Cambridge.
29. Rosenkrantz D. Programmed grammars and classes of formal languages. J. ACM. 16:1969;107-131.
30. G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Springer, Heidelberg, 1997.
31. Salomaa A. On grammars with restricted use of productions. Ann. Acad. Sci. Fenn. Ser. A. 454:1969.
32. Wood D. Bicolored digraph grammar systems. RAIRO. Oper. Res. R-1:1973;45-50.
33. Cl. Zandron, Cl. Ferretti, G. Mauri, Using membrane features in P systems, Workshop on Multiset Processing, Curtea de Argeş, Romania, 2000, in: C.S. Calude, M.J. Dinneen, Gh. Paun (Eds.), CDMTCS Report No. 140, Univeristy of Auckland, 2000, pp. 296-320.
34. Zandron Cl., Ferretti Cl., Mauri G. Solving NP-complete problems using P systems with active membranes. Antoniou I., Calude C.S., Dinneen M.J. Proc. 2nd Conf. Unconventional Models of Computation. 2000;289-301 Springer, Berlin.
35. Zandron Cl., Ferretti Cl., Mauri G. Two normal forms for rewriting P systems. Margenstern M., Rogzhin Y. Machines, Computations and Universality, 3rd Internat. Conf., MCU 2001. Lecture Notes in Computer Science. Vol. 2055:2001;153-164 Springer, Berlin.
36. Zandron Cl., Mauri G., Ferretti Cl. Universality and normal forms on membrane systems. Freund R., Kelemenova A. Proc. Internat. Workshop Grammar Systems 2000. July 2000;61-74 Bad Ischl, Austria.