On three variants of rewriting P systems

Theoretical Computer Science

Volumn 301, Issue 1-3, 2003, Pages 201-215

  Ferretti, Claudio ^a   Mauri, Giancarlo ^a   Paun, Gheorghe ^b   Zandron, Claudio ^a  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

^b INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

Chomsky hierarchy; Lindenmayer systems; Membrane computing; Regulated rewriting

Indexed keywords

COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; THEOREM PROVING; WORD PROCESSING;

REGULATED REWRITING;

FORMAL LANGUAGES;

EID: 0038709722     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00581-9     Document Type: Article

References (18)

1. Bottoni P., Labella A., Martin-Vide C., Paun Gh. Rewriting P systems with conditional communication. Brauer W., Ehrig H., Karhumaki J., Salomaa A. Formal and Natural Computing, Essays Dedicated to Gregorz Rozenberg, Lecture Notes in Computer Science, 2300. 2002;325-353 Springer, Berlin.
2. Calude C., Paun Gh. Computing with Cells and Atoms. 2000;Taylor & Francis, London.
3. J. Castellanos, A. Rodriguez-Paton, Gh. Paun, Computing with membranes: P systems with worm-objects, IEEE Seventh Internat. Conf. on String Processing and Information Retrieval, SPIRE 2000, La Coruna, Spain, pp. 64-74.
4. Dassow J., Paun Gh. Regulated Rewriting in Formal Language Theory. 1989;Springer, Berlin.
5. R. Freund, C. Martin-Vide, Gh. Paun, Computing with membranes: three more collapsing hierarchies, 2000, manuscript.
6. R. Freund, Gh. Paun, On the number of variables in graph-grammars, programmed, and matrix grammars, Proc. MCU Conf., Chişinau, Lecture Notes in Computer Science, vol. 2055, Springer, Berlin, 2001, pp. 214-225.
7. V. Geffert, Context-free-like forms for the phrase-structure grammars, Proc. MFCS'88, Lecture Notes in Computer Science, vol. 324, Springer, Berlin, 1988, pp. 309-317.
8. Hauschild D., Jantzen M. Petri nets algorithms in the theory of matrix grammars. Acta Inform. 31:1994;719-728.
9. 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.
10. Krishna S.N., Rama R. P systems with replicated rewriting. J. Automata Languages Combin. 6(3):2001;345-350.
11. Manca V., Martin-Vide C., Paun Gh. On the power of P systems with replicated rewriting. J. Automata Languages Combin. 6(3):2001;359-374.
12. Martin-Vide C., Paun Gh. Computing with membranes, One more collapsing hierarchy. Bull. EATCS. 72:2000;183-187.
13. C. Martin-Vide, Gh. Paun, String objects in P systems, Proc. Workshop on Algebraic Systems, Formal Languages and Computations, Kyoto, 2000, RIMS Kokyuroku, Kyoto Univ., 2000, pp. 161-169.
14. Paun Gh. Computing with membranes. J. Comput. System Sci. 61(1):2000;108-143. (see also Turku Center for Computer Science-TUCS Report No. 208, 1998, www.tucs.fi ).
15. Paun Gh. Computing with membranes. J. Comput. System Sci. 61(1):2000;108-143. (see also Turku Center for Computer Science-TUCS Report No. 208, 1998, www.tucs.fi ).
16. Rozenberg G., Salomaa A. The Mathematical Theory of L Systems. 1980;Academic Press, New York.
17. G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Springer, Heidelberg, 1997.
18. Cl. Zandron, G. Mauri, Cl. Ferretti, Universality and normal forms on membrane systems, in: R. Freund, A. Kelemenova (Eds.), Proc. Internat. Workshop Grammar Systems 2000 Bad Ischl, Austria, July 2000, pp. 61-74.