THE IDEMPOTENT PROBLEM FOR AN INVERSE MONOID
From MaRDI portal
Publication:3112585
DOI10.1142/S0218196711006893zbMath1246.20055MaRDI QIDQ3112585
R. Noonan Heale, N. D. Gilbert
Publication date: 11 January 2012
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Inverse semigroups (20M18)
Related Items (2)
Ordered groupoid quotients and congruences on inverse semigroups ⋮ Anisimov's Theorem for inverse semigroups
Cites Work
- Unnamed Item
- Presentations of inverse monoids
- Groups, the theory of ends, and context-free languages
- The accessibility of finitely presented groups
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Inverse semigroups on graphs
- HNN extensions of inverse semigroups with zero
- ON GROUPS AND COUNTER AUTOMATA
- Strongly E-reflexive inverse semigroups
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
This page was built for publication: THE IDEMPOTENT PROBLEM FOR AN INVERSE MONOID
