On Synthesis of Resynchronizers for Transducers

We study two formalisms that allow to compare transducers over words under origin semantics: rational and regular resynchronizers, and show that the former are captured by the latter. We then consider some instances of the following synthesis problem: given transducers T1, T2, construct a rational (resp. regular) resynchronizer R, if it exists, such that T1 is contained in R(T2) under the origin semantics. We show that synthesis of rational resynchronizers is decidable for functional, and even finite-valued, one-way transducers, and undecidable for relational one-way transducers. In the two-way setting, synthesis of regular resynchronizers is shown to be decidable for unambiguous two-way transducers. For larger classes of two-way transducers, the decidability status is open.

[1]  Meera Blattner.  Single-Valued a-Transducers , 1977, J. Comput. Syst. Sci..

[2]  Oscar H. Ibarra.  The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications , 1978, SIAM J. Comput..

[3]  John C. Shepherdson,et al.  The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

[4]  Mikolaj Bojanczyk,et al.  Transducers with Origin Information , 2013, ICALP.

[5]  Jorge E. Mezei,et al.  On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[6]  Jacques Sakarovitch,et al.  Squaring transducers: an efficient procedure for deciding functionality and sequentiality , 2000, Theor. Comput. Sci..

[7]  Christof Löding,et al.  On Equivalence and Uniformisation Problems for Finite Transducers , 2016, ICALP.

[8]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[9]  Mikolaj Bojanczyk,et al.  Which Classes of Origin Graphs Are Generated by Transducers , 2017, ICALP.

[10]  Andreas Weber.  Decomposing a k-valued Transducer into k Unambiguous Ones , 1992, LATIN.

[11]  Anca Muscholl,et al.  The Many Facets of String Transducers (Invited Talk) , 2019, STACS.

[12]  Oscar H. Ibarra,et al.  The unsolvability of the equivalence problem for e-free NGSM's with unary input (output) alphabet and applications , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[13]  Pavol Cerný,et al.  Expressiveness of streaming string transducers , 2010, FSTTCS.

[14]  Michaël Cadilhac,et al.  Unambiguous constrained Automata , 2013, Int. J. Found. Comput. Sci..

[15]  Andreas Weber.  Decomposing A k-Valued Transducer into k Unambiguous Ones , 1996, RAIRO Theor. Informatics Appl..

[16]  Arnold L. Rosenberg,et al.  Multitape One-Way Nonwriting Automata , 1968, J. Comput. Syst. Sci..

[17]  Anca Muscholl,et al.  Origin-equivalence of two-way word transducers is in PSPACE , 2018, FSTTCS.

[18]  Timothy V. Griffiths.  The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines , 1968, JACM.