Regular and First-Order List Functions

We define two classes of functions, called regular (respectively, first-order) list functions, which manipulate objects such as lists, lists of lists, pairs of lists, lists of pairs of lists, etc. The definition is in the style of regular expressions: the functions are constructed by starting with some basic functions (e.g. projections from pairs, or head and tail operations on lists) and putting them together using four combinators (most importantly, composition of functions). Our main results are that first-order list functions are exactly the same as first-order transductions, under a suitable encoding of the inputs; and the regular list functions are exactly the same as MSO-transductions.

[1]  Thomas Colcombet,et al.  A Combinatorial Theorem for Trees , 2007, ICALP.

[2]  Imre Simon,et al.  Factorization Forests of Finite Height , 1990, Theor. Comput. Sci..

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

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

[5]  Luc Dartois,et al.  Aperiodic String Transducers , 2018, Int. J. Found. Comput. Sci..

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

[7]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[8]  Mikolaj Bojanczyk.  Factorization Forests , 2009, Developments in Language Theory.

[9]  Olivier Carton,et al.  Aperiodic Two-way Transducers and FO-Transductions , 2015, CSL.

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

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

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

[13]  Ashutosh Trivedi,et al.  First-order Definable String Transformations , 2014, FSTTCS.

[14]  Richard S. Bird,et al.  An introduction to the theory of lists , 1987 .

[15]  Pedro V. Silva,et al.  Turing machines and bimachines , 2008, Theor. Comput. Sci..

[16]  Rajeev Alur,et al.  Regular combinators for string transformations , 2014, CSL-LICS.

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

[18]  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).

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

[20]  Rajeev Alur,et al.  Streaming Tree Transducers , 2012, ICALP.

[21]  Thomas Colcombet.  A combinatorial theorem for trees applications to monadic logic and infinite structures , 2007 .

[22]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[23]  Pierre-Alain Reynier,et al.  Transducers, logic and algebra for functions of finite words , 2016, SIGL.