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

DOI10.1016/J.IC.2019.104448MaRDI QIDQ2280329zbMATH OpenOpenAlexFDO

Authors 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

automatadecidabilitymonoidssemigroupsword problem

Mathematics Subject Classification ID

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

Recommendations

• HNN extensions with lower bounded inverse monoids
• The word problem for HNN-extensions of free inverse semigroups
• Context-freeness of the languages of Schützenberger automata of HNN-extensions of finite inverse semigroups
• Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups.
• Amalgams vs Yamamura's HNN-extensions of inverse semigroups.

Cites work

• Amalgamated free products of inverse semigroups
• Amalgams of free inverse semigroups.
• Amalgams of inverse semigroups and reversible two-counter machines.
• Decidability versus undecidability of the word problem in amalgams of inverse semigroups.
• Embedding Theorems for Groups
• Free Inverse Semigroups
• Groupoids, inverse semigroups, and their operator algebras
• HNN Extensions of Inverse Semigroups and Applications
• scientific article; zbMATH DE number 988810 (Why is no real title available?)
• scientific article; zbMATH DE number 3869616 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 1761434 (Why is no real title available?)
• scientific article; zbMATH DE number 2196223 (Why is no real title available?)
• Locally full HNN extensions of inverse semigroups
• Presentations of inverse monoids
• The word problem for HNN-extensions of free inverse semigroups

Cited in

(6)

• Special issue: selected papers of the 10th international conference on language and automata theory and applications, LATA 2016
• The word problem for HNN-extensions of free inverse semigroups
• Further combinatorial results for the symmetric inverse monoid
• HNN extensions with lower bounded inverse monoids
• Context-freeness of the languages of Schützenberger automata of HNN-extensions of finite inverse semigroups
• On the structure of lower bounded HNN extensions

This page was built for publication: Schützenberger automata for HNN-extensions of inverse monoids and their use in algorithmic questions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280329)