Hostname: page-component-848d4c4894-tn8tq Total loading time: 0 Render date: 2024-06-24T17:33:03.732Z Has data issue: false hasContentIssue false

Fixed points of endomorphisms of certain free products

Published online by Cambridge University Press:  23 November 2011

Pedro V. Silva*
Affiliation:
Centro de Matemática, Faculdade de Ciências, Universidade do Porto, R. Campo Alegre 687, 4169-007 Porto, Portugal. pvsilva@fc.up.pt
Get access

Abstract

The fixed point submonoid of an endomorphism of a free product of a free monoid and cyclic groups is proved to be rational using automata-theoretic techniques. Maslakova’s result on the computability of the fixed point subgroup of a free group automorphism is generalized to endomorphisms of free products of a free monoid and a free group which are automorphisms of the maximal subgroup.

Type
Research Article
Copyright
© EDP Sciences 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Benois, M., Descendants of regular language in a class of rewriting systems: algorithm and complexity of an automata construction, in Proc. of RTA 87. Lect. Notes Comput. Sci. 256 (1987) 121132. Google Scholar
J. Berstel, Transductions and Context-free Languages. Teubner, Stuttgart (1979).
Bestvina, M. and Handel, M., Train tracks and automorphisms of free groups. Ann. Math. 135 (1992) 151. Google Scholar
Bogopolski, O., Martino, A., Maslakova, O. and Ventura, E., The conjugacy problem is solvable in free-by-cyclic groups. Bull. Lond. Math. Soc. 38 (2006) 787794. Google Scholar
R.V. Book and F. Otto, String-Rewriting Systems. Springer-Verlag, New York (1993).
Cassaigne, J. and Silva, P.V., Infinite words and confluent rewriting systems: endomorphism extensions. Int. J. Algebra Comput. 19 (2009) 443490. Google Scholar
Cassaigne, J. and Silva, P.V., Infinite periodic points of endomorphisms over special confluent rewriting systems. Ann. Inst. Fourier 59 (2009) 769810. Google Scholar
Collins, D.J. and Turner, E.C., Efficient representatives for automorphisms of free products. Mich. Math. J. 41 (1994) 443464. Google Scholar
Cooper, D., Automorphisms of free groups have finitely generated fixed point sets. J. Algebra 111 (1987) 453456. Google Scholar
Gersten, S.M., Fixed points of automorphisms of free groups. Adv. Math. 64 (1987) 5185. Google Scholar
Goldstein, R.Z. and Turner, E.C., Monomorphisms of finitely generated free groups have finitely generated equalizers. Invent. Math. 82 (1985) 283289. Google Scholar
Goldstein, R.Z. and Turner, E.C., Fixed subgroups of homomorphisms of free groups. Bull. Lond. Math. Soc. 18 (1986) 468470. Google Scholar
D. Hamm and J. Shallit, Characterization of finite and one-sided infinite fixed points of morphisms on free monoids. Technical Report CS-99-17 (1999).
Head, T., Fixed languages and the adult languages of 0L schemes. Int. J. Comput. Math. 10 (1981) 103107. Google Scholar
S. Lyapin, Semigroups. Fizmatgiz. Moscow (1960). English translation by Am. Math. Soc. (1974).
Maslakova, O.S., The fixed point group of a free group automorphism. Algebra i Logika 42 (2003) 422472. English translation in Algebra Logic 42 (2003) 237–265. Google Scholar
Petrich, M. and Silva, P.V., On directly infinite rings. Acta Math. Hung. 85 (1999) 153165. Google Scholar
J. Sakarovitch, Éléments de Théorie des Automates. Vuibert, Paris (2003).
Silva, P.V., Rational subsets of partially reversible monoids. Theoret. Comput. Sci. 409 (2008) 537548. Google Scholar
Silva, P.V., Fixed points of endomorphisms over special confluent rewriting systems. Monatsh. Math. 161 (2010) 417447. Google Scholar
Sykiotis, M., Fixed subgroups of endomorphisms of free products. J. Algebra 315 (2007) 274278. Google Scholar
Ventura, E., Fixed subgroups of free groups: a survey. Contemp. Math. 296 (2002) 231255.Google Scholar