Equivalence of finite-valued streaming string transducers is decidable

TL;DR

This paper proves that determining whether two finite-valued copyless streaming string transducers are equivalent is a decidable problem, resolving a question posed in 2011.

Contribution

It establishes the decidability of equivalence for finite-valued copyless streaming string transducers, a problem previously unresolved.

Findings

Equivalence of finite-valued copyless streaming string transducers is decidable.

Provides a positive answer to a long-standing open problem from 2011.

Advances theoretical understanding of string transducer equivalence.

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.