Abstract: The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent problem is necessarily finite. This answers a question of Gilbert and Noonan Heale, and establishes a generalisation to inverse semigroups of Anisimov's Theorem for groups.
Recommendations
Cites work
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- GROUPS THAT DO AND DO NOT HAVE GROWING CONTEXT-SENSITIVE WORD PROBLEM
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
- Groups with poly-context-free word problem.
- Groups, the theory of ends, and context-free languages
- scientific article; zbMATH DE number 53545 (Why is no real title available?)
- On a wreath product embedding and idempotent pure congruences on inverse semigroups
- ON GROUPS AND COUNTER AUTOMATA
- Recursive unsolvability of a problem of Thue
- The idempotent problem for an inverse monoid.
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
- Which Kleene semigroups are finite?
- Word problems recognisable by deterministic blind monoid automata
Cited in
(6)- A finiteness criterion for inverse semigroups
- The idempotent problem for an inverse monoid.
- Inverse Subsemigroups of the Monogenic Free Inverse Semigroup
- Inverse semigroups and varieties of finite semigroups
- Quadratic Diophantine equations, the Heisenberg group and formal languages
- E-disjunctive inverse semigroups
This page was built for publication: Anisimov's theorem for inverse semigroups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5246502)
