@Article{ bruyere:hal-00403681,
Author = "Bruy{\`e}re, V{\'e}ronique and Carton, Olivier and S{\'e}nizergues, G{\'e}raud",
Abstract = "{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]).}",
affiliation = "Institute of Computer Science [mons] , Laboratoire d'informatique Algorithmique : Fondements et Applications - LIAFA , Laboratoire Bordelais de Recherche en Informatique - LaBRI",
audience = "internationale",
date-added = "2014-01-01 22:50:55 +0000",
date-modified = "2014-01-01 22:50:55 +0000",
hal_id = "hal-00403681",
Journal = "RAIRO-Theor. Inf. Appl.",
Keywords = "Finite automata; Words over linear orderings-Trees; Monadic Second Order Logics",
Language = "Anglais",
Month = "June",
Number = "2",
Pages = "321-338",
Title = "{Tree Automata and Automata on Linear Orderings}",
URL = "http://hal.archives-ouvertes.fr/hal-00403681",
Volume = "43",
Year = "2009",
bdsk-url-1 = "http://hal.archives-ouvertes.fr/hal-00403681",
File = "Tree Automata and Automata on Linear Orderings - Bruyère, Carton, Sénizergues (0) (0) (0) - a - a - s.pdf"
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A