| Title:
|
Further remarks on the complexity of regulated rewriting (English) |
| Author:
|
Dassow, Jürgen |
| Author:
|
Păun, Gheorghe |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
21 |
| Issue:
|
3 |
| Year:
|
1985 |
| Pages:
|
213-227 |
| . |
| Category:
|
math |
| . |
| MSC:
|
68Q45 |
| MSC:
|
68Q50 |
| idZBL:
|
Zbl 0603.68076 |
| idMR:
|
MR806726 |
| . |
| Date available:
|
2009-09-24T17:47:23Z |
| Last updated:
|
2012-06-05 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/125537 |
| . |
| Reference:
|
[1] J. Dassow: Remarks on the complexity of regulated rewriting.Fund. Inform. 7(1984), 83-103. Zbl 0546.68063, MR 0745539 |
| Reference:
|
[2] S. Ginsburg: The Mathematical Theory of Context-free Languages.McGraw Hill, New York 1966. Zbl 0184.28401, MR 0211815 |
| Reference:
|
[3] J. Gruska: On a classification of context-free languages.Kybernetika 3 (1967), 22-29. Zbl 0158.25401, MR 0209092 |
| Reference:
|
[4] J. Gruska: Descriptional complexity of context-free languages.In: Proc. Symp. Math. Foundations of Computer Science '73, 71 - 83. MR 0405938 |
| Reference:
|
[5] O. Ibarra: Simple matrix languages.Inform. and Control 17 (1970), 359-394. Zbl 0221.68041, MR 0274232 |
| Reference:
|
[6] O. Mayer: Some restrictive devices for context-free grammars.Inform. and Control 20 (1972), 69-92. Zbl 0248.68035, MR 0359412 |
| Reference:
|
[7] Gh. Păun: Matrix Grammars.(in Romanian). The Scientific and Encyclopaedic Publ. House, Bucharest 1981. |
| Reference:
|
[8] Gh. Păun: Six nonterminals are enough for generating a recursively enumerable language by a matrix grammar.Internat. J. Comput. Math. 75 (1984). MR 0745561 |
| Reference:
|
[9] A. Pirická-Kelemenová: .Doctoral dissertation, Bratislava 1980. |
| Reference:
|
[10] A. Salomaa: Formal Languages.Academic Press, New York 1973. Zbl 0262.68025, MR 0438755 |
| Reference:
|
[11] A. P. J. van der Walt: Random context languages.Information Processing 1971, North-Holland, Amsterdam 1972, 66-68. MR 0400823 |
| . |
