@article{KYB_1994_30_2_a6,
author = {Meduna, Alexander and Crooks, Cynthia J. and \v{S}\'arek, Milan},
title = {Syntactic complexity of regulated rewriting},
journal = {Kybernetika},
pages = {177--186},
year = {1994},
volume = {30},
number = {2},
mrnumber = {1283493},
zbl = {0819.68071},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1994_30_2_a6/}
}
Meduna, Alexander; Crooks, Cynthia J.; Šárek, Milan. Syntactic complexity of regulated rewriting. Kybernetika, Tome 30 (1994) no. 2, pp. 177-186. http://geodesic.mathdoc.fr/item/KYB_1994_30_2_a6/
[1] A. V. Aho, J. D. Ullman: The Theory of Parsing, Translation, and Computing, Vol. 1: Parsing. Prentice-Hall, N. J. 1972. | MR
[2] J. Dassow, G. Păun: Further remarks on the complexity of regulated rewriting. Kybernetika 21 (1985), 213-227. | MR
[3] J. Dassow, G. Păun: Regulated Rewriting in Formal Language Theory. Akademie-Verlag, Berlin 1989. | MR
[4] J. Dassow: Remarks on the Complexity of Regulated Rewriting. Fund. Inform. 7 (1984), 83-103. | MR | Zbl
[5] J. Gruska: Descriptional complexity of context-free languages. In: Proc. 2nd MFCS, 1973, pp. 71-83. | MR
[6] G. Păun: Six nonterminals are enough for generating a recursively enumerable language by matrix grammar. Internat. J. Comp. Math. 15 (1984). | MR
[7] A. Salomaa: Formal Languages. Academic Press, New York 1973. | MR | Zbl