Anisimov's Theorem for inverse semigroups
From MaRDI portal
Publication:5246502
DOI10.1142/S0218196715400032zbMath1314.20050arXiv1303.5239OpenAlexW2963843178MaRDI QIDQ5246502
Publication date: 21 April 2015
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.5239
idempotentsdecision problemsregular languagesidempotent problemfinitely generated inverse semigroups
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
Cites Work
- Unnamed Item
- Groups, the theory of ends, and context-free languages
- Which Kleene semigroups are finite?
- On a wreath product embedding and idempotent pure congruences on inverse semigroups
- Groups with poly-context-free word problem.
- Word problems recognisable by deterministic blind monoid automata
- THE IDEMPOTENT PROBLEM FOR AN INVERSE MONOID
- ON GROUPS AND COUNTER AUTOMATA
- GROUPS THAT DO AND DO NOT HAVE GROWING CONTEXT-SENSITIVE WORD PROBLEM
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
- Recursive Unsolvability of a problem of Thue
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM