Abstract
We explore an analogy between the family β1, of finite/cofinite languages and the family ψ1 of languages whose syntactic monoids are J-trivial. It is shown that (a) J-trivial monoids, (b)L-trivial monoids, (c) R-trivial monoids, and (d) a recently studied family, that we callK, of aperiodic monoids are natural generalization of the families of syntactic semigroups of (a) finite/cofinite languages, (b) definite languages, (c) reverse definite languages, and (d) generalized definite languages, respectively. In the case of alphabets of one and two letters, the languages corresponding to the familyK of monoids are characterized, illustrating the above-mentioned analogy explicitly.
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.
