Abstract
In this article, we first generalize the method of [13] and give some further characterizations of semigroups with [0-]quasi length. Then we give a very simple necessary and sufficient condition for a class of semigroups, including finitely generated semigroups with [0-]quasi length, finite π-groups, finite nil-extensions of finite inverse semigroups, to be syntactic. This work completely answers the following questions: “How to characterize the syntactic semigroup (monoid) of f-disjunctive languages?” or “What kind of f-disjunctive congruences is syntactic?” These questions are asked forward and studied in [6, 12, 13].
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.
