| Title:
|
Syntactic complexity of regulated rewriting (English) |
| Author:
|
Meduna, Alexander |
| Author:
|
Crooks, Cynthia J. |
| Author:
|
Šárek, Milan |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
30 |
| Issue:
|
2 |
| Year:
|
1994 |
| Pages:
|
177-186 |
| . |
| Category:
|
math |
| . |
| MSC:
|
68Q42 |
| MSC:
|
68Q45 |
| MSC:
|
68Q50 |
| idZBL:
|
Zbl 0819.68071 |
| idMR:
|
MR1283493 |
| . |
| Date available:
|
2009-09-24T18:46:07Z |
| Last updated:
|
2012-06-06 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/125000 |
| . |
| Reference:
|
[1] A. V. Aho, J. D. Ullman: The Theory of Parsing, Translation, and Computing, Vol. 1: Parsing.Prentice-Hall, N. J. 1972. MR 0408321 |
| Reference:
|
[2] J. Dassow, G. Păun: Further remarks on the complexity of regulated rewriting.Kybernetika 21 (1985), 213-227. MR 0806726 |
| Reference:
|
[3] J. Dassow, G. Păun: Regulated Rewriting in Formal Language Theory.Akademie-Verlag, Berlin 1989. MR 1067543 |
| Reference:
|
[4] J. Dassow: Remarks on the Complexity of Regulated Rewriting.Fund. Inform. 7 (1984), 83-103. Zbl 0546.68063, MR 0745539 |
| Reference:
|
[5] J. Gruska: Descriptional complexity of context-free languages.In: Proc. 2nd MFCS, 1973, pp. 71-83. MR 0405938 |
| Reference:
|
[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 |
| Reference:
|
[7] A. Salomaa: Formal Languages.Academic Press, New York 1973. Zbl 0262.68025, MR 0438755 |
| . |
