Grammar systems as language analyzers and recursively enumerable languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1684, Issue , 1999, Pages 136-147

  Bordihn, Henning ^a   Dassow, Júrgen ^a   Vaszil, Gyorgy ^b  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CONTEXT-FREE; GRAMMAR SYSTEMS; RECURSIVELY ENUMERABLE LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 84956857638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48321-7_10     Document Type: Conference Paper

References (19)

1. H. Bordihn and H. Fernau, Accepting grammars and systems. Technical Report 9/94, Universitat Karlsruhe, Fakultät für Informatik, 1994.
2. H. Bordihn and H. Fernau, Accepting grammars with regulation. Intern. J. Comp. Math. 53 (1994) 1-18.
3. H. Bordihn and H. Fernau, Accepting grammars and systems via context condition grammars. Journal of Automata, Languages and Combinatorics 1 (1996) 97-112.
4. E. Csuhaj-Varjú, J. Dassow, J. Kelemen and Gh. Păun, Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Volume 5 of Topics in Computer Mathematics. Gordon and Breach, 1994.
5. E. Csuhaj-Varjú and Gy. Vaszil, On context-free parallel communicating grammar systems: synchronization, communication, and normal forms. Accepted for publication in Theoretical Computer Science.
6. E. Csuhaj-Varjú and Gy. Vaszil, On the computational completeness of context-free parallel communicating grammar systems. Theor. Comp. Sci. 215 1-2 (1999), 349-358.
7. J. Dassow, Gh. Păun and G. Rozenberg, Grammar systems. In: A. Salomaa and G. Rozenberg (eds.), Handbook of Formal Languages, Vol. 2, Chapter 4, Springer-Verlag, Berlin-Heidelberg, 1996, 155-213.
8. H. Fernau and H. Bordihn, Remarks on accepting parallel systems. Intern. J. Comp. Math. 56 (1995) 51-67.
9. H. Fernau, M. Holzer and H. Bordihn, Accepting multi-agent systems: the case of cooperating distributed grammar systems. Computers and Artificial Intelligence 15 (1996) 123-139.
10. J. Hromkovic, On the communication complexity of distributive language generation. In: J. Dassow, G. Rozenberg and A. Salomaa (eds.), Developments in Language Theory II, World Scientific Publ. Co. Pte. Ltd., 1995, 237-246.
11. N. Mandache, On the computational power of context-free PCGSs. Submitted.
12. A. Mateescu and A. Salomaa, Aspects of classical language theory. In: A. Salo-maa and G. Rozenberg (eds.), Handbook of Formal Languages, Vol. 1, Chapter 4, Springer-Verlag, Berlin-Heidelberg, 1996, 175-251.
13. V. Mihalache, Accepting cooperating distributed grammar systems with terminal derivation. EATCS Bulletin 61 (1997) 80-84.
14. Gh. Păun, On the synchronization in parallel communicating grammar systems. Acta Informatica 30 (1993) 351-367.
15. Gh. Păun and L. Santean, Parallel communicating grammar systems: the regular case. Ann. Univ. Buc. Ser. Mat.-Inform. 37 (1989) 55-63.
16. A. Salomaa, Formal Languages. Academic Press, 1973.
17. F. L. Tiplea, C. Ene, C. M. Ionescu and O. Procopiuc. Some decision problems for parallel communicating grammar systems. Theor. Comp. Sci. 134 (1994) 365-385.
18. Gy. Vaszil, On simulating non-returning PC grammar systems with returning systems. Theor. Comp. Sci. 209 (1998), 319-329.
19. Gy. Vaszil, On parallel communicating Lindenmayer systems, In: Gh. Păun and A. Salomaa (eds.), Grammatical Models of Multi-Agent Systems, Gordon and Breach, 1999, 99-112.