The loop problem for monoids and semigroups

DOI10.1017/S0305004107000606zbMath1144.20036arXivmath/0609293OpenAlexW2130856794MaRDI QIDQ5428377

Mark Kambites

Publication date: 22 November 2007

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

zbMATH Keywords

automataCayley graphsword problemcontext-free languagesloop problem

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (3)

Inverse monoids: decidability and complexity of algebraic questions. ⋮ Homological finiteness properties of monoids, their ideals and maximal subgroups. ⋮ The loop problem for Rees matrix semigroups.

Cites Work

• Groups, the theory of ends, and context-free languages
• The accessibility of finitely presented groups
• On the definition of word hyperbolic groups.
• Automatic semigroups
• On torsion-free groups with infinitely many ends
• Subgroups of finitely presented groups
• Word hyperbolic semigroups
• On the Group of a Set of Partial Transformations

This page was built for publication: The loop problem for monoids and semigroups