Advertisement

Logic and Rational Languages of Words Indexed by Linear Orderings

  • Nicolas Bedon
  • Alexis Bès
  • Olivier Carton
  • Chloé Rispal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5010)

Abstract

We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of languages indexed by countable scattered linear orderings, but false in the general case. As a corollary we prove that the inclusion problem for rational languages of words indexed by countable linear orderings is decidable.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bedon, N.: Logic over words on denumerable ordinals. Journal of Computer and System Science 63(3), 394–431 (2001)CrossRefMathSciNetzbMATHGoogle Scholar
  2. 2.
    Bedon, N., Rispal, C.: Schützenberger and Eilenberg theorems for words on linear orderings. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 134–145. Springer, Heidelberg (2005)Google Scholar
  3. 3.
    Bès, A., Carton, O.: A Kleene theorem for languages of words indexed by linear orderings. Int. J. Found. Comput. Sci. 17(3), 519–542 (2006)CrossRefzbMATHGoogle Scholar
  4. 4.
    Bruyère, V., Carton, O.: Automata on linear orderings. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 236–247. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Bruyère, V., Carton, O.: Hierarchy among automata on linear orderings. In: Baeza-Yate, R., Montanari, U., Santoro, N. (eds.) Foundation of Information technology in the era of network and mobile computing, pp. 107–118. Kluwer Academic Publishers, Dordrecht (2002)Google Scholar
  6. 6.
    Bruyère, V., Carton, O.: Automata on linear orderings. J. Comput. System Sci. 73(1), 1–24 (2007)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Bruyère, V., Carton, O., Sénizergues, G.: Tree automata and automata on linear orderings. In: Harju, T., Karhumäki, J. (eds.) WORDS 2003, pp. 222–231. Turku Center for Computer Science (2003)Google Scholar
  8. 8.
    Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik und grundl. Math. 6, 66–92 (1960)CrossRefzbMATHGoogle Scholar
  9. 9.
    Büchi, J.R.: On a decision method in the restricted second-order arithmetic. In: Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960, pp. 1–11. Stanford University Press (1962)Google Scholar
  10. 10.
    Büchi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, pp. 2–23. North Holland, Amsterdam (1965)Google Scholar
  11. 11.
    Carton, O.: Accessibility in automata on scattered linear orderings. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 155–164. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. 12.
    Gurevich, Y.: Monadic second-order theories. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics. Perspectives in Mathematical Logic, pp. 479–506. Springer, Heidelberg (1985)Google Scholar
  13. 13.
    Ladner, R.E.: Application of model theoretic games to discrete linear orders and finite automata. Inform. Control 33 (1977)Google Scholar
  14. 14.
    McNaughton, R., Papert, S.: Counter free automata. MIT Press, Cambridge, MA (1971)zbMATHGoogle Scholar
  15. 15.
    Michaux, C., Point, F.: Les ensembles k-reconnaissables sont définissables dans < N, + ,V k > (the k-recognizable sets are definable in < N, + ,V k > ). C. R. Acad. Sci. Paris Sér. I (303), 939–942 (1986)MathSciNetGoogle Scholar
  16. 16.
    Perrin, D.: An introduction to automata on infinite words. In: Perrin, D., Nivat, M. (eds.) Automata on Infinite Words. LNCS, vol. 192, pp. 2–17. Springer, Heidelberg (1984)Google Scholar
  17. 17.
    Perrin, D.: Recent results on automata and infinite words. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 134–148. Springer, Heidelberg (1984)CrossRefGoogle Scholar
  18. 18.
    Perrin, D., Pin, J.E.: First order logic and star-free sets. J. Comput. System Sci. 32, 393–406 (1986)CrossRefMathSciNetzbMATHGoogle Scholar
  19. 19.
    Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1–35 (1969)CrossRefMathSciNetzbMATHGoogle Scholar
  20. 20.
    Rispal, C.: Automates sur les ordres linéaires: Complémentation. PhD thesis, University of Marne-la-Vallée, France (2004)Google Scholar
  21. 21.
    Rispal, C., Carton, O.: Complementation of rational sets on countable scattered linear orderings. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 381–392. Springer, Heidelberg (2004)Google Scholar
  22. 22.
    Rosenstein, J.G.: Linear orderings. Academic Press, New York (1982)zbMATHGoogle Scholar
  23. 23.
    Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inform. Control 8, 190–194 (1965)CrossRefzbMATHGoogle Scholar
  24. 24.
    Shelah, S.: The monadic theory of order. Annals of Mathematics 102, 379–419 (1975)CrossRefMathSciNetGoogle Scholar
  25. 25.
    Thomas, W.: Star free regular sets of ω-sequences. Inform. Control 42, 148–156 (1979)CrossRefzbMATHGoogle Scholar
  26. 26.
    Thomas, W.: Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 118–143. Springer, Heidelberg (1997)Google Scholar
  27. 27.
    Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 389–455. Springer, Heidelberg (1997)Google Scholar
  28. 28.
    Wojciechowski, J.: Finite automata on transfinite sequences and regular expressions. Fundamenta informaticæ 8(3-4), 379–396 (1985)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Nicolas Bedon
    • 1
  • Alexis Bès
    • 2
  • Olivier Carton
    • 3
  • Chloé Rispal
    • 1
  1. 1.Laboratoire d’informatique de l’Institut Gaspard Monge, CNRS UMR 8049Université Paris-Est and CNRS 
  2. 2.Université Paris-Est, LACL 
  3. 3.Université Paris 7 and CNRS, LIAFA, CNRS UMR 7089 

Personalised recommendations