INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
From MaRDI portal
Publication:3637970
DOI10.1142/S0218196709005111zbMath1213.68477MaRDI QIDQ3637970
Julien Cassaigne, Pedro V. Silva
Publication date: 14 July 2009
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Combinatorics on words (68R15) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35) Hyperbolic groups and nonpositively curved groups (20F67)
Related Items (12)
On the dynamics of extensions of free-abelian times free groups endomorphisms to the completion ⋮ Fixed points of endomorphisms of certain free products ⋮ Hyperbolicity of monoids presented by confluent monadic rewriting systems. ⋮ Fixed points of endomorphisms over special confluent rewriting systems. ⋮ On endomorphisms of the direct product of two free groups ⋮ Homological finiteness properties of monoids, their ideals and maximal subgroups. ⋮ The generalized conjugacy problem for virtually free groups ⋮ CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS ⋮ Finitely presented monoids with linear Dehn function need not have regular cross-sections. ⋮ ON PERIODIC POINTS OF FREE INVERSE MONOID HOMOMORPHISMS ⋮ A strong geometric hyperbolicity property for directed graphs and monoids. ⋮ Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Some decision problems about controlled rewriting systems
- Infinite periodic points of endomorphisms over special confluent rewriting systems
- On the rational subsets of the free group
- Rational subsets of partially reversible monoids
- Word hyperbolic semigroups
- Free group languages: Rational versus recognizable
This page was built for publication: INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
