Equivalence of finite-valued streaming string transducers is decidable

Abstract

In this paper we provide a positive answer to a question left open by Alur and and Deshmukh in 2011 by showing that equivalence of finite-valued copyless streaming string transducers is decidable.

References in corpus (1)

• Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method"

Cited by in corpus (1)

• Finite-valued Streaming String Transducers