On a subclass of context-free groups

 Access to full text

 Full (PDF)

1. 1. IJ. J. AALBERSBERG and G. ROZENBERG, Theory of traces, Theoret. Comput. Sci., 1988., 60, pp. 1-82. Zbl0652.68017MR947532
2. 2. A. V. ANISIMOV, Group languages, Kibernetika, 1971, 4, pp. 18-24. Zbl0241.68034MR301981
3. 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. Zbl0322.68047MR422436
4. 4. J. M. AUTEBERT, L. BOASSON and SÉNIZERGUES, Groups and NTS languages, J. Comput. Syst. Sci., 1987, 35, pp. 243-267. Zbl0626.68056MR910215
5. 5. M. BENOIS, Parties rationnelles du groupe libre, C.R. Acad. Sci. Paris, 1969, Séries A, 269, pp. 1188-1190. Zbl0214.03903MR265496
6. 6. J. BERSTEL, Tranductions and context-free languages, Teubner, 1979. Zbl0424.68040MR549481
7. 7. J. BERSTEL and J. SAKAROVITCH, Recent results in the theory of rational sets, Springer L.N.C.S., 1986, 233, pp. 15-28. Zbl0618.68070MR874586
8. 8. R. BOOK, M. JANTZEN and C. WRATHALL, Monadic Thue Systems, Theoret. Comput. Sci., 1982, 19, pp. 231-251. Zbl0488.03020MR671869
9. 9. B. v. BRAUNMÜHL and E. HOTZEL, Supercounter machines, Springer L.N.C.S., 1979, 71, pp. 58-72. Zbl0413.68047
10. 10. R. G. BURNS, A note on free groups, Proc. Amer. Math. Soc., 1969, 23, pp. 14-17. Zbl0184.04001MR252488
11. 11. M. J. DUNWOODY, The accessibility of finitely presented groups, Invent. Math., 1985, 81, pp. 449-457. Zbl0572.20025MR807066
12. 12. S. EILENBERG, Automata, languages, and machines, Vol. A, Academic Press, 1974. Zbl0317.94045MR530382
13. 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. Zbl0674.20018MR969548
14. 14. S. GINSBURG, The mathematical theory of context-free languages, McGraw-Hill, New York, 1966. Zbl0184.28401MR211815
15. 15. R. H. HARING-SMITH, Groups and simple languages, Ph. D. thesis, University of Illinois, Urbana, 1981. Zbl0518.20030MR2631708
16. 16. J. E. HOPCROFT and J. D. ULLMAN, Introduction to automata theory, languages, and computation, Addison-Wesley, 1979. Zbl0426.68001MR645539
17. 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. Zbl0642.68134
18. 18. W. MAGNUS, A. KARRASS and D. SOLITAR, Combinatorial group theory, Pure and Appl. Math., XII, Interscience publishers 1966. Zbl0138.25604
19. 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. Zbl0537.20011MR710250
20. 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. Zbl0392.20047MR519795
21. 21. J. SAKAROVITCH, Monoïdes syntactiques et langages algébriques, Thèse 3e cycle, Université Paris-VII, 1976. Zbl0362.68108
22. 22. J. SAKAROVITCH, Syntaxe des langages de Chomsky, Thèse Sc. Math., Univ. Paris-VII, 1979. 
23. 23. J. SAKAROVITCH, Sur une propriété d'itération des langages algébriques déterministres, Math. Systems Theory, 1981, 14, pp. 247-288. Zbl0472.68042MR622155
24. 24. R. E. STEARNS, A regularity test for pushdown machines, Inform. and Control, 1967, 11, pp. 323-340. Zbl0155.01901
25. 25. L. VALIANT, Regularity and related problems for deterministic pushdown automata, J. Assoc. Comput. Math., 1975, 22, pp. 1-10. Zbl0293.68046MR690083
26. 26. E. VALKEMA, Zur Charakterisierung formaler Sprachen durch Halbgruppen, Dissertation, Universität Kiel, 1974.