On grammar and language families

Fundamenta Informaticae

Volumn 25, Issue 1, 1996, Pages 17-34

  Fernau, Henning ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038503355     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-25102     Document Type: Article

References (11)

1. J. Dassow and G. Pǎun. Regulated Rewriting in Formal Language Theory. Volume 18 of EATCS Monographs in Theoretical Computer Science. Springer, Berlin, 1989.
2. H. Fernau. On Function-Limited Lindenmayer Systems. J. Inf. Process. Cybern. EIK (formerly Elektron. Inf.verarb. Kybern.) 27 (1991) 21-53.
3. F. Hinz and J. Dassow. An Undecidability Result for Regular Languages and its Application to Regulated Rewriting. EATCS Bulletin 38 (1989) 168-173.
4. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (MA), 1979.
5. N. Immerman. Nondeterministic Space is Closed under Complementation. SIAM Journal Comput. 17 (1988) 935-938.
6. P. Odifreddi. Classical Recursion Theory. Volume 125 of Studies in Logic and Foundations of Mathematics. North Holland, Amsterdam, 1989.
7. D. J. Rosenkrantz. Programmed Grammars and Classes of Formal Languages. Journal of the Association for Computing Machinery 16 (1969) 107-131.
8. A. K. Salomaa. Formal Languages. Academic Press, 1973.
9. R. Szelepcsényi. The Method of Forced Enumeration for Nondeterministic Automata. Acta Informatica 26 (1988) 279-284.
10. R. Szelepcsényi. The Method of Forcing for Nondeterministic Automata. EATCS Bulletin 33 (1988) 96-100.