The Word Problem for HNN-extensions of Free Inverse Semigroups
From MaRDI portal
Publication:2798745
DOI10.1007/978-3-319-30000-9_39zbMath1443.20086OpenAlexW2398860641MaRDI QIDQ2798745
Publication date: 13 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-30000-9_39
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 (12)
Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups ⋮ Undecidability of the word problem for Yamamura's HNN-extension under nice conditions. ⋮ HNN extensions with lower bounded inverse monoids ⋮ Embedding theorems for HNN extensions of inverse semigroups. ⋮ On the structure of lower bounded HNN extensions ⋮ HNN extensions of inverse semigroups and groupoids. ⋮ Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups. ⋮ A class of inverse monoids acting on ordered forests. ⋮ Schützenberger automata for HNN-extensions of inverse monoids and their use in algorithmic questions ⋮ Some completely semisimple HNN-extensions of inverse semigroups ⋮ Maximal subgroups of amalgams of finite inverse semigroups. ⋮ Normal forms for semigroup amalgams
This page was built for publication: The Word Problem for HNN-extensions of Free Inverse Semigroups
