Automata on linear orderings

We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these words. We prove that for countable scattered linear orderings, these two notions are equivalent. This result extends Kleene's theorem.

[1]  J. Richard Büchi.  Transfinite Automata Recursions and Weak Second Order Theory of Ordinals , 1990 .

[2]  Danièle Beauquier.  Bilimites de Langages Reconnaissables , 1984, Theor. Comput. Sci..

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

[4]  Bruno Courcelle.  Frontiers of Infinite Trees , 1978, RAIRO Theor. Informatics Appl..

[5]  Véronique Bruyère,et al.  Tree Automata and Automata on Linear Orderings , 2009, RAIRO Theor. Informatics Appl..

[6]  Olivier Carton.  Accessibility in Automata on Scattered Linear Orderings , 2002, MFCS.

[7]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Stephan Heilbrunner.  An Algorithm for the Solution of Fixed-Point Equations for Infinite Words , 1980, RAIRO Theor. Informatics Appl..

[9]  Claudine Picaronny,et al.  Accepting Zeno Words Without Making Time Stand Still , 1997, MFCS.

[10]  Yaacov Choueka.  Finite Automata, Definable Sets, and Regular Expressions over omega^n-Tapes , 1978, J. Comput. Syst. Sci..

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

[12]  Maurice Nivat,et al.  Ensembles reconnaissables de mots biinfinis , 1986 .

[13]  Eugene Asarin.  Equations on Timed Languages , 1998, HSCC.

[14]  Michael R. Hansen,et al.  Finite Divergence , 1995, Theor. Comput. Sci..

[15]  Wolfgang Thomas,et al.  Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words , 1997, Structures in Logic and Computer Science.

[16]  Patricia Bouyer,et al.  A Kleene/Büchi-like Theorem for Clock Languages , 2001, J. Autom. Lang. Comb..

[17]  Véronique Bruyère,et al.  Automata on Linear Orderings , 2001, MFCS.

[18]  Countably Complementable,et al.  LINEAR ORDERINGS , 2006 .

[19]  S. Shelah.  The monadic theory of order , 1975, 2305.00968.

[20]  Olivier Carton,et al.  Complementation of rational sets on countable scattered linear orderings , 2005, Int. J. Found. Comput. Sci..

[21]  Jan van Leeuwen,et al.  Handbook Of Theoretical Computer Science, Vol. A , 1990 .

[22]  Olivier Carton,et al.  An Eilenberg Theorem for Words on Countable Ordinals , 1998, LATIN.

[23]  Véronique Bruyère,et al.  Hierarchy Among Automata on Linear Orderings , 2002, IFIP TCS.

[24]  Paul Caspi,et al.  A Kleene theorem for timed automata , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[25]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[26]  Olivier Carton,et al.  A Kleene Theorem for Languages of Words Indexed by Linear Orderings , 2005, Developments in Language Theory.

[27]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[28]  Maurice Nivat,et al.  Ensembles reconnaissables de mots biinfinis , 1982, STOC '82.

[29]  Wolfgang Thomas.  On Frontiers of Regular Trees , 1986, RAIRO Theor. Informatics Appl..