Abstract
We use the recently developed theory of finite categories and the two-sided kernel to study the effect of the unambiguous concatenation product of recognizable languages on the syntactic monoids of the languages involved. As a result of this study we obtain an algebraic characterization (originally due to Pin) of the closure of a variety of languages under boolean operations and unambiguous concatenation, and a new proof of a theorem of Straubing characterizing the closure of a variety of languages under boolean operations and concatenation. We also note some connections to the study of the dot-depth hierarchy.
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.
