Nonterminal complexity of programmed grammars

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

Volumn 2055 LNCS, Issue , 2001, Pages 202-213

  Fernau, Henning ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA; MICROCONTROLLERS;

COMPLEXITY BOUNDS; CONTEXT-FREE; MATRIX GRAMMARS; RECURSIVELY ENUMERABLE LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 84898905682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45132-3_13     Document Type: Conference Paper

References (14)

1. J. Dassow and Gh. Pǎun. Regulated Rewriting in Formal Language Theory. Berlin: Springer, 1989.
2. H. Fernau. Unconditional transfer in regulated rewriting. Acta Informatica, 34:837-857, 1997.
3. H. Fernau. On regulated grammars under leftmost derivation. GRAMMARS, 3:37-62, 2000.
4. H. Fernau and F. Stephan. Characterizations of recursively enumerable languages by programmed grammars with unconditional transfer. Journal of Automata, Languages and Combinatorics, 4(2):117-142, 1999.
5. R. Freund and Gh. Pǎun. On the number of non-terminal symbols in graphcontrolled, programmed and matrix grammars. This volume.
6. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading (MA): Addison-Wesley, 1979.
7. T. Kasai. A hierarchy between context-free and context-sensitive languages. Journal of Computer and System Sciences, 4:492-508, 1970.
8. A. Meduna. Syntactic complexity of scattered context grammars. Acta Informatica, 32:285-298, 1995.
9. A. Meduna. Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages. International Journal of Computer Mathematics, 63:67-83, 1997.
10. A. Meduna. Generative power of three-nonterminal scattered context grammars. Theoretical Computer Science, 246:279-284, 2000.
11. A. Meduna and Gy. Horváth. On state grammars. Acta Cybernetica, 8:237-245, 1988.
12. Gh. Pǎun. Six nonterminals are enough for generating each r.e. language by a matrix grammar. International Journal of Computer Mathematics, 15:23-37, 1984.
13. D. J. Rosenkrantz. Programmed grammars and classes of formal languages. Journal of the ACM, 16(1):107-131, 1969.
14. C. E. Shannon. A universal Turing machine with two internal states. IN: Automata Studies, pages 157-165. Princeton University Press, 1956.