Finitely presented monoids with linear Dehn function need not have regular cross-sections.

DOI10.1007/s00233-013-9531-6zbMath1300.20057arXiv1203.0473OpenAlexW3100571336MaRDI QIDQ2247984

Alan J. Cain, Victor Maltcev

Publication date: 30 June 2014

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.0473

zbMATH Keywords

rewriting systemscross-sectionsDehn functions

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40)

Related Items

Markov semigroups, monoids and groups, A strong geometric hyperbolicity property for directed graphs and monoids.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperbolicity of monoids presented by confluent monadic rewriting systems.
• A finitely presented monoid which has solvable word problem but has no regular complete presentation
• Word problems and a homological finiteness condition for monoids
• Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
• On the definition of word hyperbolic groups.
• Markov semigroups, monoids and groups
• INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
• Word hyperbolic semigroups
• CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS