Which Classes of Origin Graphs Are Generated by Transducers

We study various models of transducers equipped with origin information. We consider the semantics of these models as particular graphs, called origin graphs, and we characterise the families of such graphs recognised by streaming string transducers.

[1]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..

[2]  Rajeev Alur,et al.  Streaming Tree Transducers , 2011, ICALP.

[3]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[4]  Nathan Lhote,et al.  Decidable Logics for Transductions and Data Words , 2017, ArXiv.

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

[6]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

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

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

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

[10]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

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

[12]  Anca Muscholl,et al.  Minimizing Resources of Sweeping and Streaming String Transducers , 2016, ICALP.

[13]  Michal Pilipczuk,et al.  Definability equals recognizability for graphs of bounded treewidth * , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[14]  Michal Pilipczuk,et al.  Optimizing Tree Decompositions in MSO , 2017, STACS.