Tree Automata and Automata on Linear Orderings

Véronique Bruyère (1) , Olivier Carton (2) , Géraud Sénizergues (3)

1 Institute of Computer Science [Mons]
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We show that the inclusion problem is decidable for rational languages of words indexed by scattered countable linear orderings. The method leans on a reduction to the decidability of the Monadic Second Order theory of the infinite binary tree ([Rabin 1970]).

Mots clés: Monadic Second Order Logics; Finite automata; Words over linear orderings-Trees

Domaines: Informatique et langage [cs.CL]; Logique en informatique [cs.LO]

Véronique Bruyère, Olivier Carton, Géraud Sénizergues. Tree Automata and Automata on Linear Orderings. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2009, 43 (2), pp.321-338. ⟨hal-00403681⟩