Syntactic complexity of regulated rewriting
Alexander Meduna; Cynthia J. Crooks; Milan Šárek
Kybernetika (1994)
- Volume: 30, Issue: 2, page 177-186
- ISSN: 0023-5954
Access Full Article
topHow to cite
topReferences
top- A. V. Aho, J. D. Ullman, The Theory of Parsing, Translation, and Computing, Vol. 1: Parsing, Prentice-Hall, N. J. 1972. (1972) MR0408321
- J. Dassow, G. Păun, Further remarks on the complexity of regulated rewriting, Kybernetika 21 (1985), 213-227. (1985) MR0806726
- J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory, Akademie-Verlag, Berlin 1989. (1989) MR1067543
- J. Dassow, Remarks on the Complexity of Regulated Rewriting, Fund. Inform. 7 (1984), 83-103. (1984) Zbl0546.68063MR0745539
- J. Gruska, Descriptional complexity of context-free languages, In: Proc. 2nd MFCS, 1973, pp. 71-83. (1973) MR0405938
- G. Păun, Six nonterminals are enough for generating a recursively enumerable language by matrix grammar, Internat. J. Comp. Math. 15 (1984). (1984) MR0745561
- A. Salomaa, Formal Languages, Academic Press, New York 1973. (1973) Zbl0262.68025MR0438755