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.
|Title of host publication||45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)|
|Editors||Javier Esparza, Daniel Král|
|Publisher||Schloss Dagstuhl - Leibniz-Zentrum für Informatik|
|Publication status||Published - 1 Aug 2020|
|Name||Leibniz International Proceedings in Informatics (LIPIcs)|
Bibliographical noteDBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.