Fixed points of endomorphisms over special confluent rewriting systems.
DOI10.1007/s00605-009-0124-0zbMath1236.20063OpenAlexW2145237320MaRDI QIDQ604812
Publication date: 12 November 2010
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-009-0124-0
fixed pointsCayley graphsfree products of cyclic groupsmonoid endomorphismsspecial confluent rewriting systems
Combinatorics on words (68R15) Algebraic theory of languages and automata (68Q70) Automorphisms of infinite groups (20E36) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Hyperbolic groups and nonpositively curved groups (20F67) Symbolic dynamics (37B10)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- An index for counting fixed points of automorphisms of free groups
- Rational subsets of partially reversible monoids
- Fixed subgroups of endomorphisms of free products.
- INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
This page was built for publication: Fixed points of endomorphisms over special confluent rewriting systems.