From Two-Way to One-Way Finite State Transducers

Any two-way finite state automaton is equivalent to some one-way finite state automaton. This well-known result, shown by Rabin and Scott and independently by Shepherdson, states that two-way finite state automata (even non-deterministic) characterize the class of regular languages. It is also known that this result does not extend to finite string transductions: (deterministic) two-way finite state transducers strictly extend the expressive power of (functional) one-way transducers. In particular deterministic two-way transducers capture exactly the class of MSO-transductions of finite strings. In this paper, we address the following definability problem: given a function defined by a two-way finite state transducer, is it definable by a one-way finite state transducer? By extending Rabin and Scott's proof to transductions, we show that this problem is decidable. Our procedure builds a one-way transducer, which is equivalent to the two-way transducer, whenever one exists.

[1]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

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

[3]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

[4]  Karel Culik,et al.  The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable , 1987, SIAM J. Comput..

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

[6]  Eitan M. Gurari,et al.  A note on finite-valued and finitely ambiguous transducers , 1983, Mathematical systems theory.

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

[8]  Bruno Courcelle,et al.  Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..

[9]  Jean-Camille Birget.  State-complexity of finite-state devices, state compressibility and incompressibility , 2005, Mathematical systems theory.

[10]  Pierre-Alain Reynier,et al.  Streamability of nested word transductions , 2011, FSTTCS.

[11]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[12]  Rajeev Alur,et al.  Regular Transformations of Infinite Strings , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[13]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[14]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[15]  Tero Harju,et al.  Combinatorics on Words , 2004 .

[16]  Christof Löding,et al.  Regularity Problems for Visibly Pushdown Languages , 2006, STACS.

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

[18]  Olivier Carton.  Two-Way Transducers with a Two-Way Output Tape , 2012, Developments in Language Theory.

[19]  Cristina Sirangelo,et al.  Constant-Memory Validation of Streaming XML Documents Against DTDs , 2007, ICDT.

[20]  Rodrigo de Souza.  Uniformisation of Two-Way Transducers , 2013, LATA.

[21]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[22]  Joachim Niehren,et al.  Queries on Xml streams with bounded delay and concurrency , 2011, Inf. Comput..

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

[24]  Moshe Y. Vardi.  A Note on the Reduction of Two-Way Automata to One-Way Automata , 1989, Inf. Process. Lett..

[25]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[26]  Pavol Cerný,et al.  Streaming transducers for algorithmic verification of single-pass list-processing programs , 2010, POPL '11.

[27]  M. Lothaire,et al.  Combinatorics on words: Frontmatter , 1997 .

[28]  Marcella Anselmo.  Two-Way Automata with Multiplicity , 1990, ICALP.

[29]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .