Transducers with Origin Information

Call a string-to-string function regular if it can be realised by one of the following equivalent models: mso transductions, two-way deterministic automata with output, and streaming transducers with registers. This paper proposes to treat origin information as part of the semantics of a regular string-to-string function. With such semantics, the model admits a machine-independent characterisation, Angluin-style learning in polynomial time, as well as effective characterisations of natural subclasses such as one-way transducers or first-order definable transducers.

[1]  Joost Engelfriet,et al.  Macro Tree Translations of Linear Size Increase are MSO Definable , 2003, SIAM J. Comput..

[2]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[3]  Alfred V. Aho,et al.  A Characterization of Two-Way Deterministic Classes of Languages , 1969, J. Comput. Syst. Sci..

[4]  Reinhard Klemm,et al.  Economy of Description for Single-Valued Transducers , 1994, Inf. Comput..

[5]  Joost Engelfriet,et al.  A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars , 2000, J. Comput. Syst. Sci..

[6]  Arie van Deursen,et al.  Origin Tracking and its Applications , 1996 .

[7]  Pierre-Alain Reynier,et al.  From Two-Way to One-Way Finite State Transducers , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[8]  Arie van Deursen,et al.  Origin Tracking , 1993, J. Symb. Comput..

[9]  Michal Chytil,et al.  Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings , 1977, ICALP.

[10]  Joost Engelfriet,et al.  MSO definable string transductions and two-way finite-state transducers , 1999, TOCL.

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

[12]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[13]  Eitan M. Gurari.  The equivalence problem for deterministic two-way sequential transducers is decidable , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[14]  Joachim Niehren,et al.  A learning algorithm for top-down XML transformations , 2010, PODS '10.

[15]  Rajeev Alur,et al.  Nondeterministic Streaming String Transducers , 2011, ICALP.

[16]  Thomas Schwentick,et al.  The many faces of a translation , 2006, J. Comput. Syst. Sci..