no. 3
On simple representations of language families
RAIRO. Informatique théorique, Tome 13 (1979) no. 3, pp. 241-250. 
@article{ITA_1979__13_3_241_0,
     author = {Culik II, K. and Maurer, H. A.},
     title = {On simple representations of language families},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {241--250},
     publisher = {EDP-Sciences},
     volume = {13},
     number = {3},
     year = {1979},
     mrnumber = {554685},
     zbl = {0432.68052},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1979__13_3_241_0/}
}
TY  - JOUR
AU  - Culik II, K.
AU  - Maurer, H. A.
TI  - On simple representations of language families
JO  - RAIRO. Informatique théorique
PY  - 1979
SP  - 241
EP  - 250
VL  - 13
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1979__13_3_241_0/
LA  - en
ID  - ITA_1979__13_3_241_0
ER  - 
%0 Journal Article
%A Culik II, K.
%A Maurer, H. A.
%T On simple representations of language families
%J RAIRO. Informatique théorique
%D 1979
%P 241-250
%V 13
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1979__13_3_241_0/
%G en
%F ITA_1979__13_3_241_0
Culik II, K.; Maurer, H. A. On simple representations of language families. RAIRO. Informatique théorique, Tome 13 (1979) no. 3, pp. 241-250. http://archive.numdam.org/item/ITA_1979__13_3_241_0/

1. R. V. Book, Comparing Complexity Classes, J. Comput. System Sc., Vol. 9, 1974, pp. 213-229. | MR | Zbl

2. K. Culik Ii, On Some Families of Languages Related to Developmental Systems, Intern. J. Comput. Math., Vol. 4, 1974, pp. 31-42. | MR | Zbl

3. K. Culik Ii, A Purely Homomorphic Characterization of Recursive Enumerable Sets, J. Assoc. Comput. Mach., Vol. 26, 1979, pp. 345-350. | MR | Zbl

4. K. Culik Ii and H. A. Maurer, Propagating Chain-Free Normal Forms for EOL Systems, Information and Control, Vol. 36, 1978, pp. 309-319. | MR | Zbl

5. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, 1974. | MR | Zbl

6. J. Engelfriet and G. Rozenberg, Fixed Point Languages, Equality Languages and Representations of Recursively Enumerable Languages, 19th Annual Symposium on Foundations of Computer Science, 1978, pp. 123-126.

7. S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, North Holland, Amsterdam, 1975. | MR | Zbl

8. S. Greibach, The Hardest CF Language, S.I.A.M. J. Comput., Vol. 2, 1973, pp. 304-310. | MR | Zbl

9. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass., 1978. | MR | Zbl

10. J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. | MR | Zbl

11. H. A. Maurer, Theoretische Grundlagen der Programmiersprachen, BI, Marmheim, 1969. | MR | Zbl

12. A. Salomaa, Formal Languages, Academic Press, New York, 1973. | MR | Zbl

13. A. Salomaa, Theory of Automata, Pergamon Press, London, 1969. | MR | Zbl

14. B. Wegbreit, A Generator of Context Sensitive Languages, J. Comput. System Sc., Vol. 3, 1969, pp. 456-461. | MR | Zbl