Advertisement

Level Two of the Quantifier Alternation Hierarchy over Infinite Words

  • Manfred Kufleitner
  • Tobias WalterEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9691)

Abstract

The study of various decision problems for logic fragments has a long history in computer science. This paper is on the membership problem for a fragment of first-order logic over infinite words; the membership problem asks for a given language whether it is definable in some fixed fragment. The alphabetic topology was introduced as part of an effective characterization of the fragment \(\varSigma _2\) over infinite words. Here, \(\varSigma _2\) consists of the first-order formulas with two blocks of quantifiers, starting with an existential quantifier. Its Boolean closure is \(\mathbb {B}\varSigma _2\). Our first main result is an effective characterization of the Boolean closure of the alphabetic topology, that is, given an \(\omega \)-regular language L, it is decidable whether L is a Boolean combination of open sets in the alphabetic topology. This is then used for transferring Place and Zeitoun’s recent decidability result for \(\mathbb {B}\varSigma _2\) from finite to infinite words.

References

  1. 1.
    Brzozowski, J.A., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. J. Comput. Syst. Sci. 16(1), 37–55 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Diekert, V., Gastin, P., Kufleitner, M.: A survey on small fragments of first-order logic over finite words. Int. J. Found. Comput. Sci. 19(3), 513–548 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Diekert, V., Kufleitner, M.: Fragments of first-order logic over infinite words. Theor. Comput. Syst. 48(3), 486–516 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Eilenberg, S.: Automata, Languages, and Machines, vol. B. Academic Press, New York (1976)zbMATHGoogle Scholar
  5. 5.
    Kallas, J., Kufleitner, M., Lauser, A.: First-order fragments with successor over infinite words. In: STACS 2011, Proceedings, vol. 9. LIPIcs, pp. 356–367. Dagstuhl Publishing (2011)Google Scholar
  6. 6.
    Kufleitner, M., Walter, T.: Level two of the quantifier alternation hierarchy over infinite words (2015). CoRR, abs/1509.06207Google Scholar
  7. 7.
    Kufleitner, M., Walter, T.: One quantifier alternation in first-order logic with modular predicates. RAIRO-Theor. Inf. Appl. 49(1), 1–22 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Landweber, L.H.: Decision problems for \(\omega \)-automata. Math. Syst. Theor. 3(4), 376–384 (1969)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inf. Control 9, 521–530 (1966)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Perrin, D., Pin, J.-É.: Infinite words. Pure and Applied Mathematics. Elsevier, Amsterdam (2004)zbMATHGoogle Scholar
  11. 11.
    Pierron, T., Place, T., Zeitoun, M.: Quantifier alternation for infinite words (2015). CoRR, abs/1511.09011Google Scholar
  12. 12.
    Pin, J.-É.: A variety theorem without complementation. Russ. Math. (Iz. VUZ) 39, 80–90 (1995)MathSciNetGoogle Scholar
  13. 13.
    Pin, J.-É.: Syntactic Semigroups. Handbook of Formal Languages. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  14. 14.
    Place, T., Zeitoun, M.: Going higher in the first-order quantifier alternation hierarchy on words. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 342–353. Springer, Heidelberg (2014)Google Scholar
  15. 15.
    Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. 30, 264–286 (1930)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Schwarz, S., Staiger, L.: Topologies refining the Cantor topology on \(X^{\omega }\). In: Calude, C.S., Sassone, V. (eds.) Theoretical Computer Science. IFIP Advances in Information and Communication Technology, vol. 323. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  17. 17.
    Staiger, L., Wagner, K.W.: Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. Elektron. Inform.-verarb. Kybernetik 10, 379–392 (1974)MathSciNetzbMATHGoogle Scholar
  18. 18.
    Straubing, H.: Finite semigroup varieties of the form \(\mathbf{V}\ast \mathbf{D}\). J. Pure Appl. Algebra 36(1), 53–94 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston (1994)CrossRefzbMATHGoogle Scholar
  20. 20.
    Thomas, W.: Classifying regular events in symbolic logic. J. Comput. Syst. Sci. 25, 360–376 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 133–191. Elsevier, Cambridge (1990). chap. 4Google Scholar
  22. 22.
    Wilke, T.: Locally threshold testable languages of infinite words. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds.) STACS 1993. LNCS, vol. 665, pp. 607–616. Springer, Heidelberg (1993)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.FMIUniversität StuttgartStuttgartGermany

Personalised recommendations