Advertisement

On Expressive Power of Regular Expressions over Infinite Orders

  • Alexander RabinovichEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9691)

Abstract

Two fundamental results of classical automata theory are the Kleene theorem and the Büchi-Elgot-Trakhtenbrot theorem. Kleene’s theorem states that a language of finite words is definable by a regular expression iff it is accepted by a finite state automaton. Büchi-Elgot-Trakhtenbrot’s theorem states that a language of finite words is accepted by a finite-state automaton iff it is definable in the weak monadic second-order logic. Hence, the weak monadic logic and regular expressions are expressively equivalent over finite words. We generalize this to words over arbitrary linear orders.

References

  1. 1.
    Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeit. Math. Logik und Grundl. Math. 6, 66–92 (1960)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford University Press (1962)Google Scholar
  3. 3.
    Colcombet, T.: Personal communication, September 2012Google Scholar
  4. 4.
    Elgot, C.: Decision problems of finite-automata design and related arithmetics. Trans. Am. Math. Soc. 98, 21–51 (1961)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Gurevich, Y.: Monadic second order theories. In: Barwise, J., Feferman, S. (eds.) Model Theoretic Logics, pp. 479–506. Springer, Heidelberg (1986)Google Scholar
  6. 6.
    Hintikka, J.: Distributive normal forms in the calculus of predicates. Acta Philos. Fennica 6 (1953)Google Scholar
  7. 7.
    Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies, pp. 3–41. Princeton University Press (1956)Google Scholar
  8. 8.
    Ladner, R.E.: Application of model theoretical games to linear orders and finite automata theory. Inf. Control 9, 521–530 (1977)MathSciNetGoogle Scholar
  9. 9.
    Läuchli, H., Leonard, J.: On the elementary theory of linear order. Fund. Math. 59, 109–116 (1966)MathSciNetzbMATHGoogle Scholar
  10. 10.
    McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inf. Control 9, 521–530 (1966)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    McNaughton, R., Papert, S.: Counter-Free Automata. The MIT Press, Cambridge (1971)zbMATHGoogle Scholar
  12. 12.
    Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1–35 (1969)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Rabinovich, A.: Star free expressions over the reals. Theoret. Comput. Sci. 233, 233–245 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Shelah, S.: The monadic theory of order. Ann. Math. 102, 379–419 (1975). Ser. 2MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Thomas, W.: Star free regular sets of \(\omega \)-sequences. Inf. Control 42, 148–156 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Thomas, W.: Ehrenfeucht games, the composition method, and the monadic theory. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 118–143. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  17. 17.
    Trakhtenbrot, B.A.: The synthesis of logical nets whose operators are described in terms of one-place predicate calculus. Doklady Akad. Nauk SSSR 118(4), 646–649 (1958)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.The Blavatnik School of Computer ScienceTel Aviv UniversityTel AvivIsrael

Personalised recommendations