A note on dpda transductions of {0,1}∗and inverse dpda transductions of the dyck set

DOI10.1080/00207168108803235zbMath0454.68098OpenAlexW2066876611MaRDI QIDQ3902534

Paul M. B. Vitányi

Publication date: 1981

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168108803235

zbMATH Keywords

context free languagesDyck languagesstack automatonsimple deterministic pushdown transductions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items (2)

VLSI-sorting evaluated under the linear model ⋮ On characterizations of recursively enumerable languages

Cites Work

• Characterization theorems on abstract families of transducers
• On inverse deterministic pushdown transductions
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on dpda transductions of {0,1}^∗and inverse dpda transductions of the dyck set