Equivalence of finite-valued streaming string transducers is decidable
Formal Languages and Automata Theory
2019-05-01 v2
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.
Cite
@article{arxiv.1902.06973,
title = {Equivalence of finite-valued streaming string transducers is decidable},
author = {Anca Muscholl and Gabriele Puppis},
journal= {arXiv preprint arXiv:1902.06973},
year = {2019}
}
Related papers
View all related →
Formal Languages and Automata Theory · Computer Science
Finite-valued Streaming String Transducers
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Anca Muscholl +2
2025-05-14
Formal Languages and Automata Theory · Computer Science
On Streaming String Transducers and HDT0L Systems
Emmanuel Filiot, Pierre-Alain Reynier
2014-12-02
Formal Languages and Automata Theory · Computer Science
On Equivalence and Uniformisation Problems for Finite Transducers
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
2016-03-01
Formal Languages and Automata Theory · Computer Science
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable
Helmut Seidl, Sebastian Maneth, Gregor Kemper
2017-01-30
Logic in Computer Science · Computer Science
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
Joost Engelfriet, Sebastian Maneth
2007-05-23
Formal Languages and Automata Theory · Computer Science
On polynomial grammars extended with substitution
Janusz Schmude
2021-02-18
Formal Languages and Automata Theory · Computer Science
Definability Results for Top-Down Tree Transducers
Sebastian Maneth, Helmut Seidl, Martin Vu
2021-06-01
Formal Languages and Automata Theory · Computer Science
FO-definable transformations of infinite strings
Vrunda Dave, Shankara Narayanan Krishna, Ashutosh Trivedi
2016-07-20
Formal Languages and Automata Theory · Computer Science
Undecidability in Finite Transducers, Defense Systems and Finite Substitutions
Vesa Halava
2021-12-01
Formal Languages and Automata Theory · Computer Science
One-way resynchronizability of word transducers
Sougata Bose, S. N. Krishna, Anca Muscholl, Gabriele Puppis
2021-01-21
Logic in Computer Science · Computer Science
Termination of Triangular Integer Loops is Decidable
Florian Frohn, Jürgen Giesl
2019-05-22
Formal Languages and Automata Theory · Computer Science
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
Adrien Boiret, Raphaela Palenta
2016-06-14
Formal Languages and Automata Theory · Computer Science
Register transducers are marble transducers
Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin
2020-05-05
Logic in Computer Science · Computer Science
String Solving with Word Equations and Transducers: Towards a Logic for Analysing Mutation XSS (Full Version)
Anthony W. Lin, Pablo Barcelo
2015-11-06
Computational Complexity · Computer Science
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata
Elisabet Burjons, Fabian Frei, Martin Raszyk
2021-05-03
Formal Languages and Automata Theory · Computer Science
From Two-Way to One-Way Finite State Transducers
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
2013-04-29
Formal Languages and Automata Theory · Computer Science
On Shuffling and Splitting Automata
Ignacio Mollo Cunningham
2024-07-04
Programming Languages · Computer Science
Polyregular equivalence is undecidable in higher-order types
Mikołaj Bojańczyk, Grzegorz Fabiański, Rafał Stefański
2026-04-15
Formal Languages and Automata Theory · Computer Science
Equivalence of Linear Tree Transducers with Output in the Free Group
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
2020-03-16
Machine Learning · Computer Science
A Canonical Semi-Deterministic Transducer
Achilles Beros, Colin de la Higuera
2016-10-12
Formal Languages and Automata Theory · Computer Science
Chain-Free String Constraints (Technical Report)
Parosh Aziz Abdulla, Mohamed Faouzi Atig Bui Phi Diep, Lukáš Holík, Petr Janků
2023-07-11
Formal Languages and Automata Theory · Computer Science
Aperiodic String Transducers
Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier
2016-06-10
Formal Languages and Automata Theory · Computer Science
Lipschitz Robustness of Finite-state Transducers
Thomas A. Henzinger, Jan Otop, Roopsha Samanta
2014-10-08
Formal Languages and Automata Theory · Computer Science
Revisiting the Equivalence Problem for Finite Multitape Automata
James Worrell
2013-05-06
Formal Languages and Automata Theory · Computer Science
Composing Copyless Streaming String Transducers
Rajeev Alur, Taylor Dohmen, Ashutosh Trivedi
2024-02-08