Abstract
Given a class C of languages, let Pol( C ) be the polynomial closure of C , that is, the smallest class of languages containing C and closed under the operations union and marked product LaL', where a is a letter. We determine the polynomial closure of various classes of rational languages and we study the properties of polynomial closures. For instance, if C is closed under quotients (resp. quotients and inverse morphism) then Pol( C ) has the same property. Our main result shows that if C is a boolean algebra closed under quotients then Pol( C ) is closed under intersection. As an application, we refine the concatenation hierarchy introduced by Straubing and we show that the levels 1 2 and 3 2 of this hierarcy are decidable.
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.
