| Issue |
RAIRO-Theor. Inf. Appl.
Volume 43, Number 2, April-June 2009
|
|
|---|---|---|
| Page(s) | 321 - 338 | |
| DOI | https://doi.org/10.1051/ita/2009009 | |
| Published online | 03 April 2009 | |
Tree Automata and Automata on Linear Orderings
1
Université de Mons-Hainaut, France; Veronique.Bruyere@umh.ac.be
2
LIAFA, Université Paris 7, France; Olivier.Carton@liafa.jussieu.fr
3
LaBRI, Université de Bordeaux I, France; ges@labri.u-bordeaux.fr
Received:
15
June
2007
Accepted:
5
November
2008
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 [9].
Mathematics Subject Classification: 68Q45 / 03D05.
Key words: Finite automata / words over linear orderings-trees / monadic second order logics.
© EDP Sciences, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.