Advertisement

Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank

  • Olivier Carton
  • Chloé Rispal
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2976)

Abstract

In a preceding paper (Bruyère and Carton, automata on linear orderings, MFCS’01), automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite and even transfinite words studied by Büchi. Kleene’s theorem has been generalized to these words. We show that deterministic automata do not have the same expressive power. Despite this negative result, we prove that rational sets of words of finite ranks are closed under complementation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, London (1974)zbMATHGoogle Scholar
  2. 2.
    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) IGM report 2001-12CrossRefGoogle Scholar
  3. 3.
    Bruyère, V., Carton, O.: Hierarchy among automata on linear orderings. In: IFIP TCS 2002, pp. 107–118 (2002) Google Scholar
  4. 4.
    Bedon, N.: Finite automata and ordinals. Theoret. Comput. Sci. 156, 119–144 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bedon, N.: Automata, semigroups and recognizability of words on ordinals. Int. J. Alg. Comput. 8, 1–21 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bedon, N., Carton, O.: An Eilenberg theorem for words on countable ordinals. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 53–64. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik und grundl. Math. 6, 66–92 (1960)Google Scholar
  8. 8.
    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, pp. 1–11. Stanford University Press (1962)Google Scholar
  9. 9.
    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
  10. 10.
    Choueka, Y.: Finite automata, definable sets, and regular expressions over ω n-tapes. J. Comput. System Sci. 17(1), 81–97 (1978)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Girault-Beauquier, D.: Bilimites de langages reconnaissables. Theoret. Comput. Sci. 33(2-3), 335–342 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Hausdorff, F.: Set theory. In Chelsea, New York (1957)Google Scholar
  13. 13.
    Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E. (ed.) Automata studies, pp. 3–41. Princeton University Press, Princeton (1956)Google Scholar
  14. 14.
    Muller, D.: Infinite sequences and finite machines. In: Proc. of Fourth Annual IEEE Symp., editor, Switching Theory and Logical Design, pp. 3–16 (1963)Google Scholar
  15. 15.
    Nivat, M., Perrin, D.: Ensembles reconnaissables de mots bi-infinis. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 47–59 (1982)Google Scholar
  16. 16.
    Perrin, D., Pin, J.E.: Infinite words. In: Elsevier (ed.) Academic Press, London (2003)Google Scholar
  17. 17.
    Pin, J.-E.: Syntactic semigroups. In: Handbook of formal languages, vol. 1, pp. 679–746. Springer, Heidelberg (1997)Google Scholar
  18. 18.
    Rabin, M.O.: Decidability of second-order theories and automata on infinite trees 141, 1–35 (1969)Google Scholar
  19. 19.
    Ramsey, F.D.: On a problem of formal logic. Proc. of the London math. soc. 30, 338–384 (1929)Google Scholar
  20. 20.
    Rosenstein, J.G.: Linear ordering. Academic Press, New York (1982)Google Scholar
  21. 21.
    Safra, S.: On the complexity of ω-automata. In: 29th Annual Symposium on Foundations of computer sciences, pp. 24–29 (1988)Google Scholar
  22. 22.
    Wojciechowski, J.: Finite automata on transfinite sequences and regular expressions. Fundamenta informaticæ 8(3-4), 379–396 (1985)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Olivier Carton
    • 1
  • Chloé Rispal
    • 2
  1. 1.LIAFAUniversité Paris 7Paris cedex 05France
  2. 2.IGMUniversité de Marne-la-ValléeMarne-la-Vallée Cedex 2France

Personalised recommendations