Abstract
Recently, the complete solution of systems of language equations over a one-letter alphabet has been derived where the operators are union, concatenation and star. This paper addresses the question of adding the complementation operator. It is known that if no stars are present and if the concatenation operator is restricted, such equations need not have solutions, but if they do, they can be solved explicitly if the constants are regular in which case the solutions are also regular. In this paper we study language equations over a one-letter alphabet where unrestricted concatenation interacts with complementation, union, and star. We define a procedure for determining a regular solution of the general type of equation assuming that all constants are regular, discuss its properties, and show examples. We then prove that in general equations with complementation and complementation and concatenation in which all constants are regular may have nonregular solutions. This shows that language equations can be used to obtain non-context-free languages from regular languages using only operators under which the regular languages are closed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.