Fixed points of endomorphisms of certain free products
DOI10.1051/ita/2011125zbMath1266.20069MaRDI QIDQ2911434
Publication date: 31 August 2012
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/221956
free products; confluent rewriting systems; fixed points of endomorphisms; fixed point submonoids; SC monoids
68R15: Combinatorics on words
20M05: Free semigroups, generators and relations, word problems
68Q70: Algebraic theory of languages and automata
20E36: Automorphisms of infinite groups
20M35: Semigroups in automata theory, linguistics, etc.
20E05: Free nonabelian groups
20E06: Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20F67: Hyperbolic groups and nonpositively curved groups
Related Items
Cites Work
- Fixed points of endomorphisms over special confluent rewriting systems.
- Infinite periodic points of endomorphisms over special confluent rewriting systems
- Monomorphisms of finitely generated free groups have finitely generated equalizers
- Automorphisms of free groups have finitely generated fixed point sets
- Train tracks and automorphisms of free groups
- Efficient representatives for automorphisms of free products
- Fixed points of automorphisms of free groups
- On directly infinite rings
- Rational subsets of partially reversible monoids
- Fixed subgroups of endomorphisms of free products.
- THE CONJUGACY PROBLEM IS SOLVABLE IN FREE-BY-CYCLIC GROUPS
- INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
- Fixed Subgroups of Homomorphisms of Free Groups
- Fixed languages and the adult languages of ol schemest†
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
