Reversible Pushdown Transducers
Deterministic pushdown transducers are studied with respect to their ability to compute reversible transductions, that is, to transform inputs into outputs in a reversible way. This means that the transducers are also backward deterministic and thus are able to uniquely step the computation back and forth. The families of transductions computed are classified with regard to four types of length-preserving transductions as well as to the property of working reversibly. It turns out that accurate to one case separating witness transductions can be provided. For the remaining case it is possible to establish the equivalence of both families by proving that stationary moves can always be removed in length-preserving reversible pushdown transductions.
- 1.Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol. I: Parsing. Prentice-Hall Inc., Englewood Cliffs (1972)Google Scholar
- 6.Dartois, L., Fournier, P., Jecker, I., Lhote, N.: On reversible transducers. In: ICALP 2017, LIPIcs, vol. 80, pp. 113:1–113:12. Schloss Dagstuhl (2017)Google Scholar
- 10.Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66–75. IEEE Computer Society (1997)Google Scholar