no. 3
On a subclass of context-free groups
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 3, pp. 255-272. 
@article{ITA_1991__25_3_255_0,
     author = {Herbst, Thomas},
     title = {On a subclass of context-free groups},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {255--272},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {3},
     year = {1991},
     mrnumber = {1119044},
     zbl = {0751.68040},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1991__25_3_255_0/}
}
TY  - JOUR
AU  - Herbst, Thomas
TI  - On a subclass of context-free groups
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
SP  - 255
EP  - 272
VL  - 25
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1991__25_3_255_0/
LA  - en
ID  - ITA_1991__25_3_255_0
ER  - 
%0 Journal Article
%A Herbst, Thomas
%T On a subclass of context-free groups
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 255-272
%V 25
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1991__25_3_255_0/
%G en
%F ITA_1991__25_3_255_0
Herbst, Thomas. On a subclass of context-free groups. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 3, pp. 255-272. http://www.numdam.org/item/ITA_1991__25_3_255_0/

1. Ij. J. Aalbersberg and G. Rozenberg, Theory of traces, Theoret. Comput. Sci., 1988., 60, pp. 1-82. | MR | Zbl

2. A. V. Anisimov, Group languages, Kibernetika, 1971, 4, pp. 18-24. | MR | Zbl

3. A. V. Anisimov and F. D. Seifert, Zur algebraischen Charakteristik der durch kontextfreie Sprachen definierten Gruppen, Elektr. Inf. und Kybernetik, 1975, 11, pp. 695-702. | MR | Zbl

4. J. M. Autebert, L. Boasson and Sénizergues, Groups and NTS languages, J. Comput. Syst. Sci., 1987, 35, pp. 243-267. | MR | Zbl

5. M. Benois, Parties rationnelles du groupe libre, C.R. Acad. Sci. Paris, 1969, Séries A, 269, pp. 1188-1190. | MR | Zbl

6. J. Berstel, Tranductions and context-free languages, Teubner, 1979. | MR | Zbl

7. J. Berstel and J. Sakarovitch, Recent results in the theory of rational sets, Springer L.N.C.S., 1986, 233, pp. 15-28. | MR | Zbl

8. R. Book, M. Jantzen and C. Wrathall, Monadic Thue Systems, Theoret. Comput. Sci., 1982, 19, pp. 231-251. | MR | Zbl

9. B. V. Braunmühl and E. Hotzel, Supercounter machines, Springer L.N.C.S., 1979, 71, pp. 58-72. | Zbl

10. R. G. Burns, A note on free groups, Proc. Amer. Math. Soc., 1969, 23, pp. 14-17. | MR | Zbl

11. M. J. Dunwoody, The accessibility of finitely presented groups, Invent. Math., 1985, 81, pp. 449-457. | EuDML | MR | Zbl

12. S. Eilenberg, Automata, languages, and machines, Vol. A, Academic Press, 1974. | MR | Zbl

13. C. Frougny, J. Sakarovitch and P. Schupp, Finiteness conditions on subgroups and formal languages theory, Proc. London Math. Soc., 1989, 58, pp. 74-88. | MR | Zbl

14. S. Ginsburg, The mathematical theory of context-free languages, McGraw-Hill, New York, 1966. | MR | Zbl

15. R. H. Haring-Smith, Groups and simple languages, Ph. D. thesis, University of Illinois, Urbana, 1981. | MR

16. J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, 1979. | MR | Zbl

17. M. Jantzen, M. Kudlek, K. Lange and H. Petersen, Dyck1-reductions of context-free languages, Springer L.N.C.S., 1987, 278, pp. 218-227. | Zbl

18. W. Magnus, A. Karrass and D. Solitar, Combinatorial group theory, Pure and Appl. Math., XII, Interscience publishers 1966. | Zbl

19. D. E. Muller and P. Schupp, Groups, the theory of ends, and context-free languages, J. Comput. System. Sci., 1983, 26, pp. 295-310. | MR | Zbl

20. J. F. Perrot, Introduction aux monoïdes syntactiques des langages algébriques, in J.-P. CRESTIN and M. NIVAT Eds., Actes des premières journées d'informatique théorique, Bonascre 1973, E.N.S.T.A., Paris, 1978, pp. 167-222. | MR | Zbl

21. J. Sakarovitch, Monoïdes syntactiques et langages algébriques, Thèse 3e cycle, Université Paris-VII, 1976.

22. J. Sakarovitch, Syntaxe des langages de Chomsky, Thèse Sc. Math., Univ. Paris-VII, 1979.

23. J. Sakarovitch, Sur une propriété d'itération des langages algébriques déterministres, Math. Systems Theory, 1981, 14, pp. 247-288. | MR | Zbl

24. R. E. Stearns, A regularity test for pushdown machines, Inform. and Control, 1967, 11, pp. 323-340. | Zbl

25. L. Valiant, Regularity and related problems for deterministic pushdown automata, J. Assoc. Comput. Math., 1975, 22, pp. 1-10. | MR | Zbl

26. E. Valkema, Zur Charakterisierung formaler Sprachen durch Halbgruppen, Dissertation, Universität Kiel, 1974.