Fixed points of endomorphisms of certain free products
Publication:2911434
DOI10.1051/ITA/2011125zbMath1266.20069OpenAlexW2105904493MaRDI 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 productsconfluent rewriting systemsfixed points of endomorphismsfixed point submonoidsSC monoids
Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Automorphisms of infinite groups (20E36) Semigroups in automata theory, linguistics, etc. (20M35) Free nonabelian groups (20E05) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Hyperbolic groups and nonpositively curved groups (20F67)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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†
This page was built for publication: Fixed points of endomorphisms of certain free products
