On Two-Way Transducers

We look at some classes of two-way transducers with auxiliary memory and investigate their containment and equivalence problems. We believe that our results are the strongest known to date concerning two-way transducers.

[1]  Oscar H. Ibarra.  On the universe, disjointness, and containment problems for simple machines , 2010, Inf. Comput..

[2]  Karel Culik,et al.  The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable , 1986, MFCS.

[3]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[4]  Timothy V. Griffiths.  The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines , 1968, JACM.

[5]  Eitan M. Gurari.  The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable , 1982, SIAM J. Comput..

[6]  Eitan M. Gurari,et al.  A note on finite-valued and finitely ambiguous transducers , 1983, Mathematical systems theory.

[7]  Eitan M. Gurari,et al.  The Complexity of Decision Problems for Finite-Turn Multicounter Machines , 1981, J. Comput. Syst. Sci..

[8]  Oscar H. Ibarra,et al.  The unsolvability of the equivalence problem for e-free NGSM's with unary input (output) alphabet and applications , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Oscar H. Ibarra.  The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications , 1978, SIAM J. Comput..

[10]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[11]  Seymour Ginsburg,et al.  Deterministic Context Free Languages , 1966, Inf. Control..

[12]  Andreas Weber,et al.  Decomposing Finite-Valued Transducers and Deciding Their Equivalence , 1993, SIAM J. Comput..

[13]  Oscar H. Ibarra,et al.  Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines , 2012, Int. J. Found. Comput. Sci..