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. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1051/ita/2011125 | RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | Field | DocType |
Endomorphisms,fixed points,free products | Combinatorics,Free product,Cyclic group,Automorphism,Maximal subgroup,Free monoid,Mathematics,Free group,Ping-pong lemma,Endomorphism | Journal |
Volume | Issue | ISSN |
46 | SP1 | 0988-3754 |
Citations | PageRank | References |
3 | 0.68 | 3 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Pedro V. Silva | 1 | 141 | 29.42 |