Hostname: page-component-788cddb947-w95db Total loading time: 0 Render date: 2024-10-15T12:48:50.322Z Has data issue: false hasContentIssue false
  • English
  • Français

Tree Automata and Automata on Linear Orderings

Published online by Cambridge University Press:  03 April 2009

Véronique Bruyère ,
Olivier Carton  and
Géraud Sénizergues
Véronique Bruyère
Affiliation:
Université de Mons-Hainaut, France; Veronique.Bruyere@umh.ac.be
Olivier Carton
Affiliation:
LIAFA, Université Paris 7, France; Olivier.Carton@liafa.jussieu.fr
Géraud Sénizergues
Affiliation:
LaBRI, Université de Bordeaux I, France; ges@labri.u-bordeaux.fr
Get access

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

Keywords

Finite automatawords over linear orderings-treesmonadic second order logics.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 43 , Issue 2 , April 2009 , pp. 321 - 338
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bruyère, V. and Carton, O., Automata on linear orderings, edited by J. Sgall, A. Pultr and P. Kolman, MFCS'2001. Lect. Notes Comput. Sci. 2136 (2001) 236–247. CrossRef
Bruyère, V., Carton, O. and Sénizergues, G., Tree automata and automata on linear orderings, in Proceedings WORDS'03. Lect. Notes Comput. Sci. 27 (2003) 222–231. TUCS General Publication.
Bruyère, V. and Carton, O., Automata on linear orderings. J. Comput. System Sci. 73 (2007) 1–24. CrossRef
Carton, O., Accessibility in automata on scattered linear orderings, edited by K. Diks and W. Rytter, MFCS'2002. Lect. Notes Comput. Sci. 2420 (2002) 155–164. CrossRef
Courcelle, B., Frontiers of infinite trees. RAIRO Theoretical Informatics 12 (1978) 319–337. CrossRef
Hausdorff, F., Grundzüge einer Theorie der geordneten Mengen. Math. Ann. 65 (1908) 435–505. CrossRef
Heilbrunner, S., An algorithm for the solution of fixed-point equations for infinite words. RAIRO Theoretical Informatics 14 (1980) 131–141. CrossRef
S.C. Kleene, Representation of events in nerve nets and finite automata, edited by C.E. Shannon, Automata studies, 3–41. Princeton University Press, Princeton (1956).
Rabin, M.O., Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141 (1969) 1–35.
Rispal, C. and Carton, O., Complementation of rational sets on countable scattered linear orderings. J. Found. Comput. Sci. 16 (2005) 767–786. CrossRef
J.G. Rosenstein, Linear Orderings. Academic Press, New York (1982).
Thomas, W., On frontiers of regular sets. RAIRO Theoretical Informatics 20 (1986) 371–381. CrossRef