Regular resynchronizability of origin transducers is undecidable
Formal Languages and Automata Theory
2020-07-02 v3
Abstract
We study the relation of containment up to unknown regular resynchronization between two-way non-deterministic transducers. We show that it constitutes a preorder, and that the corresponding equivalence relation is properly intermediate between origin equivalence and classical equivalence. We give a syntactical characterization for containment of two transducers up to resynchronization, and use it to show that this containment relation is undecidable already for one-way non-deterministic transducers, and for simple classes of resynchronizations. This answers the open problem stated in recent works, asking whether this relation is decidable for two-way non-deterministic transducers.
Cite
@article{arxiv.2002.07558,
title = {Regular resynchronizability of origin transducers is undecidable},
author = {Denis Kuperberg and Jan Martens},
journal= {arXiv preprint arXiv:2002.07558},
year = {2020}
}