Generative power of three-nonterminal scattered context grammars

Theoretical Computer Science

Volumn 246, Issue 1-2, 2000, Pages 279-284

  Meduna, Alexander ^a  

^a BRNO UNIVERSITY OF TECHNOLOGY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013370707     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00153-5     Document Type: Article

References (7)

1. J. Dassow, G. Paun, Regulated Rewriting in Formal Language Theory, Springer, New York, 1989.
2. H.C.M. Kleijn, G. Rozenberg, On the generative power of regular pattern grammars, Acta Inform. 20 (1983) 391-411.
3. A. Meduna, Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages, Int. J. Comput. Math. 51 (1996) 465-474.
4. A. Meduna, Terminating left-hand sides of scattered context productions, Theoret. Comput. Sci. 237 (2000) 423-427.
5. A. Meduna, Automata and Languages: Theory and Applications, Springer, London, 2000.
6. Proceedings of the International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, July 20-23, 1999, Ed. by J. Dassow and D. Wotschke, Otto-von-Guericke University, Magdeburg, Germany, 1999.
7. Proceedings of the Second Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, July 27-29, 2000, London, Canada (in press).