Context-free rewriting systems and word-hyperbolic structures with uniqueness
From MaRDI portal
Publication:4902680
Abstract: This paper proves that any monoid presented by a confluent context-free monadic rewriting system is word-hyperbolic. This result then applied to answer a question asked by Duncan & Gilman by exhibiting an example of a word-hyperbolic monoid that does not admit a word-hyperbolic structure with uniqueness (that is, in which the language of representatives maps bijectively onto the monoid).
Recommendations
- Hyperbolicity of monoids presented by confluent monadic rewriting systems.
- INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
- MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
- Publication:3026992
- About the descriptive power of certain classes of finite string-rewriting systems
Cites work
Cited in
(8)- A language hierarchy of binary relations
- On the word problem for special monoids
- Decision problems for word-hyperbolic semigroups
- A strong geometric hyperbolicity property for directed graphs and monoids.
- Markov semigroups, monoids and groups.
- MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
- Finitely presented monoids with linear Dehn function need not have regular cross-sections.
- Growths of endomorphisms of finitely generated semigroups
This page was built for publication: Context-free rewriting systems and word-hyperbolic structures with uniqueness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902680)