A note on dpda transductions of {0,1}∗and inverse dpda transductions of the dyck set
Paul M. B. Vitanyi · International Journal of Computer Mathematics · 1981
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.