Nonterminal complexity of programmed grammars

Theoretical Computer Science

Volumn 296, Issue 2, 2003, Pages 225-251

  Fernau, Henning ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

Descriptional complexity; Matrix grammars; Nonterminal complexity; Programmed grammars; Regulated rewriting

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; CONTEXT FREE GRAMMARS; FORMAL LANGUAGES;

NONTERMINAL COMPLEXITY; PROGRAMMED GRAMMERS;

COMPUTATIONAL GRAMMARS;

EID: 0037426287     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00656-4     Document Type: Conference Paper

References (23)

1. Bordihn H., Fernau H. Accepting grammars with regulation. Internat. J. Comput. Math. 53:1994;1-18.
2. H. Bordihn, H. Fernau, M. Holzer, Accepting pure grammars, Publicationes Mathematicae, Debrecen, Vol. 60 Supplement (2002), pp. 483-510.
3. Dassow J., Fernau H., Paun Gh. On the leftmost derivation in matrix grammars. Internat. J. Found. Comput. Sci. 10:1999;61-80.
4. Dassow J., Paun Gh. Regulated rewriting in formal language theory. EATCS Monographs in Theoretical Computer Science. Vol. 18:1989;Springer, Berlin.
5. Fernau H. Unconditional transfer in regulated rewriting. Acta Inform. 34:1997;837-857.
6. Fernau H. On regulated grammars under leftmost derivation. GRAMMARS. 3:2000;37-62.
7. Fernau H. Nonterminal complexity of programmed grammars. Margenstern M., Rogozhin Y. Machines, Computations and Universality, 3rd Internat. Conf., MCU 2001, Lecture Notes in Computer Science. Vol. 2055:2001;202-213 Springer, Berlin.
8. Fernau H., Freund R. Accepting array grammars with control mechanisms. Paun Gh., Salomaa A. New Trends in Formal Languages, Lecture Notes in Computer Science. Vol. 1218:1997;95-118 Springer, Berlin.
9. Fernau H., Stephan F. Characterizations of recursively enumerable languages by programmed grammars with unconditional transfer. J. Automata Languages Combin. 4(2):1999;117-142.
10. Freund R., Paun Gh. On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. Margenstern M., Rogozhin Y. Machines, Computations and Universality, 3rd Internat. Conf., MCU 2001, Lecture Notes in Computer Science. Vol. 2055:2001;214-225 Springer, Berlin.
11. Greibach S. Remarks on blind and partially blind one-way multicounter machines. Theoret. Comput. Sci. 7:1978;311-324.
12. Hauschildt D., Jantzen M. Petri net algorithms in the theory of matrix grammars. Acta Inform. 31:1994;719-728.
13. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading, MA.
14. Kasai T. A hierarchy between context-free and context-sensitive languages. J. Comput. System Sci. 4:1970;492-508.
15. Margenstern M., Rogozhin Y. Machines, Computations and Universality, 3rd Internat. Conf., MCU 2001, Lecture Notes in Computer Science. Vol. 2055:2001;Springer, Berlin.
16. Martín-Vide C., Paun Gh. Computing with membranes (P systems): universality results. Margenstern M., Rogozhin Y. Machines, Computations and Universality, 3rd Internat. Conf., MCU 2001, Lecture Notes in Computer Science. Vol. 2055:2001;82-101 Springer, Berlin.
17. Meduna A. Syntactic complexity of scattered context grammars. Acta Inform. 32:1995;285-298.
18. Meduna A. Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages. Internat. J. Comput. Math. 63:1997;67-83.
19. Meduna A. Generative power of three-nonterminal scattered context grammars. Theoret. Comput. Sci. 246:2000;279-284.
20. Meduna A., Horváth Gy. On state grammars. Acta Cybernet. 8:1988;237-245.
21. Paun Gh. Six nonterminals are enough for generating each r.e. language by a matrix grammar. Internat. J. Comput. Math. 15:1984;23-37.
22. Rosenkrantz D.J. Programmed grammars and classes of formal languages. J. ACM. 16(1):1969;107-131.
23. Shannon C.E. A universal Turing machine with two internal states. Automata Studies. 1956;157-165 Princeton University Press, Princeton, NJ.