About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Meduna, Alexander ; Crooks, Cynthia J. ; Šárek, Milan
Syntactic complexity of regulated rewriting. (English). Kybernetika, vol. 30 (1994), issue 2, pp. 177-186
MSC: 68Q42, 68Q45, 68Q50 | MR 1283493 | Zbl 0819.68071
References:
[1] A. V. Aho, J. D. Ullman: The Theory of Parsing, Translation, and Computing, Vol. 1: Parsing. Prentice-Hall, N. J. 1972. MR 0408321
[2] J. Dassow, G. Păun: Further remarks on the complexity of regulated rewriting. Kybernetika 21 (1985), 213-227. MR 0806726
[3] J. Dassow, G. Păun: Regulated Rewriting in Formal Language Theory. Akademie-Verlag, Berlin 1989. MR 1067543
[4] J. Dassow: Remarks on the Complexity of Regulated Rewriting. Fund. Inform. 7 (1984), 83-103. MR 0745539 | Zbl 0546.68063
[5] J. Gruska: Descriptional complexity of context-free languages. In: Proc. 2nd MFCS, 1973, pp. 71-83. MR 0405938
[6] G. Păun: Six nonterminals are enough for generating a recursively enumerable language by matrix grammar. Internat. J. Comp. Math. 15 (1984). MR 0745561
[7] A. Salomaa: Formal Languages. Academic Press, New York 1973. MR 0438755 | Zbl 0262.68025
Partner of
EuDML logo