On the containment and equivalence problems for two-way transducers

Authors:
Oscar H. Ibarra;Hsu-Chun Yen
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA 93106, USA;Department of Electrical Engineering, National Taiwan University, Taipei, 106, Taiwan, ROC
Venue:
Theoretical Computer Science
Year:
2012

Citing 7
Cited 1

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
Nondeterministic streaming string transducers

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II

Some decision problems concerning NPDAs, palindromes, and dyck languages

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	5.23

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.