Tree Automata and Automata on Linear Orderings

Issue		RAIRO-Theor. Inf. Appl. Volume 43, Number 2, April-June 2009


Page(s)		321 - 338
DOI		10.1051/ita/2009009
Published online		03 April 2009

RAIRO-Theor. Inf. Appl. 43, 321-338 (2009)
DOI: 10.1051/ita/2009009

Tree Automata and Automata on Linear Orderings

Véronique Bruyère¹, Olivier Carton² and Géraud Sénizergues³

¹ Université de Mons-Hainaut, France; Veronique.Bruyere@umh.ac.be
² LIAFA, Université Paris 7, France; Olivier.Carton@liafa.jussieu.fr
³ LaBRI, Université de Bordeaux I, France; ges@labri.u-bordeaux.fr

Received June 15, 2007. Accepted November 5, 2008. Published online 3 April 2009

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 [9].

Mathematics Subject Classification. 68Q45, 03D05.

Key words: Finite automata -- words over linear orderings-trees -- monadic second order logics.

© EDP Sciences 2008

What is OpenURL?

The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access. An OpenURL link contains article metadata and directs it to the OpenURL server of your choice. The OpenURL server can provide access to the resource and also offer complementary services (specific search engine, export of references...). The OpenURL link can be generated by different means.

If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.