Abstract
Given any amalgam [Formula: see text] of inverse semigroups, we show how to construct an amalgam [Formula: see text] such that [Formula: see text] is embedded into [Formula: see text], where [Formula: see text], [Formula: see text], [Formula: see text] and, for any [Formula: see text] and [Formula: see text] with [Formula: see text] in [Formula: see text], where [Formula: see text], there exists [Formula: see text] with [Formula: see text] in [Formula: see text]; that is, [Formula: see text] is a lower bounded subsemigroup of [Formula: see text] and [Formula: see text]. A recent paper by the author describes the Schützenberger automata of [Formula: see text], for an amalgam [Formula: see text] where [Formula: see text] is lower bounded in [Formula: see text] and [Formula: see text], giving conditions for [Formula: see text] to have decidable word problem. Thus we can study [Formula: see text] by considering [Formula: see text]. As an example, we generalize results by Cherubini, Jajcayová, Meakin, Piochi and Rodaro on amalgams of finite inverse semigroups.
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.
