On a subclass of context-free groups
Herbst, Thomas
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991), p. 255-272 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1991-01-01
@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},
     volume = {25},
     year = {1991},
     pages = {255-272},
     mrnumber = {1119044},
     zbl = {0751.68040},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 255-272. http://gdmltest.u-ga.fr/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 947532 | Zbl 0652.68017

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

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 422436 | Zbl 0322.68047

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

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

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

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 874586 | Zbl 0618.68070

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

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

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

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

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

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 969548 | Zbl 0674.20018

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

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

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

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 0642.68134

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

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 710250 | Zbl 0537.20011

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 519795 | Zbl 0392.20047

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 622155 | Zbl 0472.68042

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

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

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