Schützenberger automata for HNN-extensions of inverse monoids and their use in algorithmic questions

DOI10.1016/j.ic.2019.104448zbMath1435.68204OpenAlexW2970146394MaRDI QIDQ2280329

Tatiana Baginová Jajcayová

Publication date: 18 December 2019

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2019.104448

zbMATH Keywords

semigroupsautomataword problemdecidabilitymonoids

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Inverse semigroups (20M18)

Related Items

HNN extensions with lower bounded inverse monoids ⋮ On the structure of lower bounded HNN extensions ⋮ Unnamed Item ⋮ Special issue: selected papers of the 10th international conference on language and automata theory and applications, LATA 2016

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Presentations of inverse monoids
• Amalgams of free inverse semigroups.
• Groupoids, inverse semigroups, and their operator algebras
• Amalgams of inverse semigroups and reversible two-counter machines.
• Locally full HNN extensions of inverse semigroups
• The Word Problem for HNN-extensions of Free Inverse Semigroups
• Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups
• Free Inverse Semigroups
• HNN Extensions of Inverse Semigroups and Applications
• Embedding Theorems for Groups
• Amalgamated free products of inverse semigroups