Abstract
We considerer the families of languages produced by two-way transducers, and prove iteration lemmas for them. Thus it is shown that the Dyck language D′ 1 * doesn't belong to the deterministic family, and consequently that the Dyck language D′ 2 * doesn't belong to the non-deterministic one. Therefore the Dyck language D′ 1 * is not an EDTOL language.
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.
