Abstract
We consider the family of languages whose syntactic monoids are R -trivial. Languages whose syntactic monoids are J -trivial correspond to a congruence which tests the subwords of length n or less that appear in a given word, for some integer n. We show that in the R -trivial case the required congruence also takes into account the order in which these subwords first appear, from left to right. Characterizations of the related finite automata and regular expressions are summarized. Dual results for L -trivial monoids are also discussed.
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.
