Rewriting P systems: Improved hierarchies

Theoretical Computer Science

Volumn 334, Issue 1-3, 2005, Pages 161-175

  Mutyam, Madhu ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

Computational universality; Conditional communication; Hybrid P systems; Leftmost rewriting; Matrix languages; P systems; Penttonen normal form; Recursively enumerable languages; Replicated rewriting; Rewriting P systems

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; MATRIX ALGEBRA; MEMBRANES; PROBLEM SOLVING;

COMPUTATIONAL UNIVERSALITY; CONDITIONAL COMMUNICATION; HYBRID P SYSTEMS; LEFTMOST REWRITING; MATRIX LANGUAGES; P SYSTEMS; PENTTONEN NORMAL FORM; RECURSIVELY ENUMERABLE LANGUAGES; REPLICATED REWRITING; REWRITING P SYSTEMS;

NATURAL SCIENCES COMPUTING;

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

References (14)

1. P. Bottoni, A. Labella, C. Martín-Vide, Gh. P̂un, Rewriting P systems with conditional communication, in: W. Brauer, H. Ehrig, J. Karhumäki, A. Salomaa (Eds.), Formal and Natural Computing. Essays Dedicated to Grzegorz Rozenberg, Lecture Notes in Computer Science, Vol. 2300, Springer, Berlin, 2002, pp. 325-353.
2. J. Dassow, and Gh. P̂un Regulated Rewriting in Formal Language Theory 1989 Springer Berlin
3. C. Ferretti, G. Mauri, Gh. P̂un, and C. Zandron On three variants of P systems with string-objects Theoret. Comput. Sci. 301 1-3 2003 201 215
4. R. Freund, Gh. P̂un, On the number of non-terminal symbols in graph-controlled, programmed, and matrix grammars, in: M. Margenstern, Y. Rogozhin (Eds.), Machines, Computations, and Universality, 3rd Internat. Conf. Lecture Notes in Computer Science, Vol. 2055, Springer, Berlin, 2001, pp. 214-225.
5. S.N. Krishna, K. Lakshmanan, and R. Rama Hybrid P systems Romanian J. Inform. Sci. Technol. 4 1 2001 111 124
6. S.N. Krishna, and R. Rama P systems with replicated rewriting J. Automata, Languages Combinator. 6 3 2001 345 350
7. M. Madhu, and K. Krithivasan Contextual P systems Fund. Inform. 49 1-3 2002 179 189
8. M. Madhu, and K. Krithivasan A note on hybrid P systems Grammars 5 3 2002 239 244
9. M. Madhu, K. Krithivasan, A survey on some variants of P systems, in: Gh. P̂un, G. Rozenberg, A. Salomaa, C. Zandron (Eds.), Membrane Computing, International Workshop, WMC-CdeA 2002, Lecture Notes in Computer Science, Vol. 2597, Springer, Berlin, 2003, pp. 360-370.
10. V. Manca, C. Martin-Vide, and Gh. P̂un On P systems with replicated rewriting J. Automata, Languages Combinator. 6 3 2001 359 374
11. C. Martin-Vide, Gh. P̂un, String objects in P systems, Proc. Algebraic Systems, Formal Languages and Computations Workshop, RIMS Kokyuroku, Kyoto University, Kyoto, 2000, pp. 161-169.
12. Gh. P̂un Computing with membranes J. Comput. System Sci. 61 1 2000 108 143
13. Gh. P̂un, Membrane Computing. An Introduction, Springer, Berlin, 2002.
14. A. Salomaa, Formal Languages, Academic Press, New York, 1973.