Abstract
It is shown that the simple deterministic pushdown transductions of {0,1}∗ equal the class of context free languages (by means of an elementary proof). Several new results are presented concerning the class of source languages which can be compiled into Dyck languages by a DPDA transducer, i.e., the class DPDT-1 (D 2). It is shown that this language family does not 2 have the Parikh property and is incomparable with the unambiguous context free languages, the bounded context free languages, the linear context free languages, the one-way deterministic stack automaton languages and the one-way non-deterministic stack automaton languages.
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.
