On the rational subsets of the free group

Acta Informatica

Volumn 33, Issue 3, 1996, Pages 281-296

  Sénizergues, Géraud ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040158209     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050045     Document Type: Article

References (31)

1. Anisimov, A.V.: Group languages. Kibernetica 4, 18-24 (1971)
2. Autebert, J.M., Boasson, L., Sénizergues, G.: Groups and NTS languages. JCSS 35 (2), 243-267 (1987)
3. Berstel, J.: Transductions and context-free languages. Teubner, 1979
4. Berstel, J., Boasson, L.: Context-free languages. In handbook of theoretical computer science, vol. B, Chap. 2, pp. 59-102. Amsterdam: Elsevier 1991
5. Berstel, J., Sakarovitch, J.: Recent results in the theory of rational sets. In Proc. M.F.C.S. 86', (Lect. Notes Comput. Sci., vol. 233, pp. 15-28) Berlin, Heidelberg, New York: Springer, 1986
6. Birget, J.C., Margolis, S., Meakin, J., Weil, P.: space-completeness of certain algorithmic problems on the subgroups of the free groups. In Proc. ICALP 94 (Lect. Notes Comput. Sci., Vol. 820, pp. 274-285) Berlin, Heidelberg, New York: Springer 1994
7. Book, R.V.: Decidable sentences of Church-Rosser congruences. Theoret. Comput. Sci. 24, 301-312 (1983)
8. Book, R.V., Otto, F.: String rewriting systems. Texts and monographs in computer science. Berlin, Heidelberg, New York: Springer 1993
9. Courcelle, B.: Graph rewriting: an algebraic and logical approach. In Handbook of theoretical computer science, Chap. 5, pp. 195-242 (Amsterdam: Elsevier
10. Courcelle, B.: Basic notions of universal algebra for language theory and graph grammars. Tutorial submitted to Theoret. Comput. Sci., pp 1-69 (1994)
11. Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In Handbook of theoretical computer science, Vol. B, Chap. 2, pp. 243-320. Amsterdam, Elsevier, 1991
12. Dicks, W., Dunwoody, M.J.: Groups acting on graphs. Cambridge: Cambridge University Press, 1989
13. Dunwoody, M.J.: The accessiblity of finitely presented groups. Invent. Math. 81, 449-457 (1985)
14. Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoret. Comput. Sci. 27, 311-322 (1983)
15. Eilenberg, S.: Automata, languages and machines, Vol. A. New York: Academic Press 1974
16. Greenberg, L.: Discrete groups of motions. Canad. J. Math. 12, 414-425 (1960)
17. Greibach, S.: A note on pushdown store automaton and regular systems. Proc. Amer. Math. Soc., pp. 263-268, 1967
18. Harrison, M.A.: Introduction to formal language theory. Reading, MA: Addison-Wesley 1978
19. Karrass, A., Solitar, D.: On free products. Proc. Amer. Math. Soc. 8, pp. 217-221, 1957
20. Kuhn, N., Madlener, K., Otto, F.: Computing presentations for sub-groups of polycyclic groups and of context-free groups. A.A.E.C.C. 5, 287-316 (1994)
21. Lyndon, R.C., Schupp, P.E.; Combinatorial group theory. Berlin, Heidelberg, New York: Springer 1977
22. Madlener, K., Otto, F.: About the descriptive power of certain classes of finite string-rewriting sytems. Theoret. Comput. Sci. 67, 143-172 (1989)
23. Madlener, K., Otto, F.: Decidable sentences for context-free groups. In Proc. STACS91, (Lect. Notes Comput. Sci., Vol. 480, pp. 160-171) Berlin, Heidelberg, New York: Springer 1991
24. Magnus, W., Karass, A., Solitar, D.: Combinatorial group theory. New York: Interscience Publishers 1966
25. Muller, D.E., Schupp, P.E.: Groups, the theory of ends, and context-free languages. J.C.S.S. 26 (3), 295-310 (1983)
26. Sakarovitch, J.: Syntaxe des langages de Chomsky, essai sur le déterminisme. Ph.D. Thesis, Université Paris, 7, 1970
27. Sakarovitch, J.: Description des monoïdes de type fini. Elektronische Informationsverarbeitung und Kybernetik 17 (8/9), 417-434 (1981)
28. Sakarovitch, J.: A problem on rational subsets of the free group. Amer. Math. Monthly 91 (8), 499-501 (1984)
29. Sénizergues, G.: On the finite subgroups of a context-free group. In preparation, preliminar version presented at the workshop ASMICS on Cayley graphs, Lyon, 1993; full version to appear in the Proceedings of the Workshop on Computational Aspects of Geometric Groups held at DIMACS, March 1994
30. Sénizergues, G.: On the finite subgroups of a context-free group. In preparation, preliminar version presented at the workshop ASMICS on Cayley graphs, Lyon, 1993; full version to appear in the Proceedings of the Workshop on Computational Aspects of Geometric Groups held at DIMACS, March 1994
31. Sénizergues, G.: An effective version of Stallings' theorem in the case of context-free groups. In Proc. ICALP 93 (Lect. Notes Comput. Sci. vol. 700, pp. 479-495) Berlin, Heidelberg, New York: Springer, 1993