Abstract
The main theorem gives a sufficient condition for an AFL to be the closure under union of the set of images under rational transductions of any of its sets of generators. All the AFL's known to have this property satisfy the given condition. As an application we give a short proof of the fact that every generator of the AFL of algebraic (context-free) languages is a faithful generator, i.e. can be mapped onto every algebraic language by a faithful (& free) rational transduction.
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.
