Abstract
AbstractWe investigate two operators on classes of regular languages: polynomial closure (\(Pol\)) and Boolean closure (\(Bool\)). We apply these operators to classes of group languages \(\mathcal {G}\) and to their well-suited extensions \(\mathcal {G} ^+\), which is the least Boolean algebra containing \(\mathcal {G} \) and \(\{\varepsilon \}\). This yields the classes \(Bool(Pol(\mathcal {G}))\) and \(Bool(Pol(\mathcal {G} ^+))\) . These classes form the first level in important classifications of classes of regular languages, called concatenation hierarchies, which admit natural logical characterizations. We present generic algebraic characterizations of these classes. They imply that one may decide whether a regular language belongs to such a class, provided that a more general problem called separation is decidable for the input class \(\mathcal {G}\). The proofs are constructive and rely exclusively on notions from language and automata theory.KeywordsRegular languagesGroup languagesConcatenation hierarchiesMembership
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.
