On two-way transducers

Authors:
Oscar H. Ibarra;Hsu-Chun Yen
Affiliations:
Dept. of Computer Science, Univ. of California, Santa Barbara, CA;Dept. of Electrical Engineering, National Taiwan Univ., Taipei, Taiwan, ROC
Venue:
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Year:
2011

Citing 6
Cited 0

The equivalence of finite valued transducers (on HDT0L languages) is decidable

Theoretical Computer Science
Decomposing finite-valued transducers and deciding their equivalence

SIAM Journal on Computing
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On the universe, disjointness, and containment problems for simple machines

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.