Abstract
We show that for any context-free language L⊆T + there is a length-preserving ho-momorphism μ and a homomorphism λ such that L=(a D)a,b))λ -1 µ, where D(a, b) denotes the Dyck set over the alphabet {a, b}. λ and μ may be effectively constructed.
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.
