Abstract
Schützenberger automata are instrumental in the study of structural and algorithmic questions for inverse semigroup presentations as shown by the combinatorial approach introduced by Munn [1], and extended by Stephen [2]. HNN-extensions, a classical construction originally from group theory, proved useful in the study of decidability questions when introduced to the classes of semigroups and inverse semigroups. In our work [3], we studied HNN-extensions of inverse semigroups via structure of their Schützenberger automata.The main result of this paper is a characterization of the Schützenberger automata of a rather rich and interesting class of lower bounded HNN-extensions. The automata have an especially nice lobe structure, and contain a special subgraph - a core - a subgraph with finitely many lobes from which all vital information about the automaton can be restored. These nice properties yield in some cases an effective construction of the Schützenberger automata and thus have pleasant consequences for algorithmic problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
