Small overlap monoids. I: The word problem.

DOI10.1016/j.jalgebra.2008.09.038zbMath1222.20039arXiv0712.0250OpenAlexW2963463670MaRDI QIDQ1024387

Mark Kambites

Publication date: 17 June 2009

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

semigroupsword problemsmall cancellation theorymonoidsfinite presentationssmall overlap conditions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Cancellation theory of groups; application of van Kampen diagrams (20F06)

Related Items (5)

An explicit algorithm for normal forms in small overlap monoids ⋮ A note on the definition of small overlap monoids. ⋮ Generic complexity of finitely presented monoids and semigroups ⋮ ON UNIFORM DECISION PROBLEMS AND ABSTRACT PROPERTIES OF SMALL OVERLAP MONOIDS ⋮ The word problem for one-relation monoids: a survey

Uses Software

• GAP
• Smalloverlap

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Easy multiplications. II: Extensions of rational semigroups
• Easy multiplications. I: The realm of Kleene's theorem
• On the geometry of semigroup presentations
• Combinatorial group theory and public key cryptography
• ALMOST EVERY GROUP IS HYPERBOLIC

This page was built for publication: Small overlap monoids. I: The word problem.