Abstract
The operation of nested iterated substitution preserves languages with the semilinear property. As a consequence, the following generalization of Parikh's theorem that each context-free language has the semilinear property is obtained: If \ L is a family of languages with the semilinear property closed under intersection with regular sets and finite substitution, all members of the least superAFL containing \ L have the semilinear property.
Sign-in/Register to access full text options 
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.
