Anisimov's theorem for inverse semigroups.

DOI10.1142/S0218196715400032zbMATH Open1314.20050arXiv1303.5239OpenAlexW2963843178MaRDI QIDQ5246502FDOQ5246502

Authors: Mark Kambites 

Publication date: 21 April 2015

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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.

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

Recommendations

• The idempotent problem for an inverse monoid.
• Inverse Subsemigroups of the Monogenic Free Inverse Semigroup
• Finite idempotent inverse monoid presentations.
• Amalgams of finite inverse semigroups.
• RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS

zbMATH Keywords

idempotentsregular languagesdecision problemsidempotent problemfinitely generated inverse semigroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Inverse semigroups (20M18) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Recursive unsolvability of a problem of Thue
• Groups with poly-context-free word problem.
• Word problems recognisable by deterministic blind monoid automata
• ON GROUPS AND COUNTER AUTOMATA
• Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
• GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
• Groups, the theory of ends, and context-free languages
• On a wreath product embedding and idempotent pure congruences on inverse semigroups
• The idempotent problem for an inverse monoid.
• Which Kleene semigroups are finite?
• GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
• GROUPS THAT DO AND DO NOT HAVE GROWING CONTEXT-SENSITIVE WORD PROBLEM

Cited In (4)

• Inverse Subsemigroups of the Monogenic Free Inverse Semigroup
• Inverse semigroups and varieties of finite semigroups
• The idempotent problem for an inverse monoid.
• A finiteness criterion for 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)