Abstract
The alternation hierarchy in two-variable first-order logic FO2[<] over words was shown to be decidable by Kufleitner and Weil, and independently by Krebs and Straubing. We consider a similar hierarchy, reminiscent of the half levels of the dot-depth hierarchy or the Straubing-Thérien hierarchy. The fragment \({{\Sigma }^{2}_{m}}\) of FO2 is defined by disallowing universal quantifiers and having at most m−1 nested negations. The Boolean closure of \({{\Sigma }^{2}_{m}}\) yields the m th level of the FO2-alternation hierarchy. We give an effective characterization of \({{\Sigma }^{2}_{m}}\), i.e., for every integer m one can decide whether a given regular language is definable in \({{\Sigma }^{2}_{m}}\). Among other techniques, the proof relies on an extension of block products to ordered monoids.
Similar content being viewed by others
References
Almeida, J., Weil, P.: Profinite categories and semidirect products. J. Pure Appl. Algebra 123(1–3), 1–50 (1998)
Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, 66–92 (1960)
Cohen, R.S., Brzozowski, J.A.: Dot-depth of star-free events. J. Comput. Syst. Sci. 5(1), 1–16 (1971)
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)
Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer (1995)
Eilenberg, S.: Automata, Languages, and Machines, vol. B. Academic Press, New York and London (1976)
Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21–51 (1961)
Fleischer, L., Kufleitner, M., Lauser, A.: Block products and nesting negations in FO 2. In: Proceedings of CSR 2014 of LNCS, vol. 8476, p 2014. Springer
Glaßer, Ch., Schmitz, H.: Languages of dot-depth 3/2. Theory Comput. Syst. 42(2), 256–286 (2008)
Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California (1968)
Knast, R.: A semigroup characterization of dot-depth one languages. RAIRO, Inf. Théor. 17(4), 321–330 (1983)
Krebs, A., Straubing, H.: An effective characterization of the alternation hierarchy in two-variable logic. In: Proceedings of FSTTCS 2012 of LIPIcs, vol. 18, p 2012. Dagstuhl Publishing
Kufleitner, M., Lauser, A.: Languages of dot-depth one over infinite words. In: Proceedings of LICS 2011, pp 23–32. IEEE Computer Society (2011)
Kufleitner, M., Lauser, A.: Around dot-depth one. Int. J. Comput. Sci. 23 (6), 1323–1339 (2012)
Kufleitner, M., Lauser, A.: The join levels of the Trotter-Weil hierarchy are decidable. In: Proceedings of MFCS 2012 of LNCS, vol. 7464, pp 603–614. Springer (2012)
Kufleitner, M., Lauser, A.: The join of the varieties of R-trivial and L-trivial monoids via combinatorics on words. Discrete Math. Theor. Comput. Sci. 14(1), 141–146 (2012)
Kufleitner, M., Lauser, A.: Quantifier alternation in two-variable first-order logic with successor is decidable. In: Proceedings of STACS 2013 of LIPIcs, vol. 20, p 2013. Dagstuhl Publishing
Kufleitner, M., Weil, P.: The FO2 alternation hierarchy is decidable. In: Proceedings of CSL 2012 of LIPIcs, vol. 16, pp 426–439. Dagstuhl Publishing (2012)
McNaughton, R., Papert, S.: Counter-Free Automata. The MIT Press (1971)
Pin, J.-É.: A variety theorem without complementation. In: Russian Mathematics (Iz. VUZ), vol. 39, pp 80–90 (1995)
Pin, J.-É., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Syst. 30(4), 383–422 (1997)
Pin, J.-É., Weil, P.: Semidirect products of ordered semigroups. Commun. Algebra 30(1), 149–169 (2002)
Pin, J.-É., Weil, P.: The wreath product principle for ordered semigroups. Commun. Algebra 30(12), 5677–5713 (2002)
Place, Th., Zeitoun, M.: Going higher in the first-order quantifier alternation hierarchy on words. In: Proceedings of ICALP 2014 of LNCS, vol. 8573, pp 342–353. Springer (2014)
Rhodes, J., Tilson, B.: The kernel of monoid morphisms. J. Pure Appl. Algebra 62(3), 227–268 (1989)
Rhodes, J., Weil, P.: Decomposition techniques for finite semigroups, using categories II. J. Pure Appl. Algebra 62(3), 285–312 (1989)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8, 190–194 (1965)
Schwentick, Th., Thérien, D., Vollmer, H.: Partially-ordered two-way automata: A new characterization of DA. In: Proceedings of DLT 2001 of LNCS, vol. 2295, pp 239–250. Springer (2002)
Simon, I.: Piecewise testable events. In: 2nd GI Conference of Automation, Theoretical Formation Languages of LNCS, vol. 33, pp 214–222. Springer (1975)
Straubing, H.: Families of recognizable sets corresponding to certain varieties of finite monoids. J. Pure Appl. Algebra 15(3), 305–318 (1979)
Straubing, H.: Aperiodic homomorphisms and the concatenation product of recognizable sets. J. Pure Appl. Algebra 15(3), 319–327 (1979)
Straubing, H.: A generalization of the Schützenberger product of finite monoids. Theor. Comput. Sci. 13, 137–150 (1981)
Straubing, H.: Finite semigroup varieties of the form V∗D. J. Pure Appl. Algebra 36(1), 53–94 (1985)
Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser (1994)
Straubing, H.: Algebraic characterization of the alternation hierarchy in FO2[<] on finite words. In: Proceedings of CSL 2011 of LIPIcs, vol. 12, pp 525–537. Dagstuhl Publishing (2011)
Tesson, P., Thérien, D.: Diamonds are forever: The variety DA. In: Proceedings of Semigroups, Algorithms, Automata and Languages 2001, pp 475–500. World Scientific (2002)
Thérien, D.: Classification of finite monoids: The language approach. Theor. Comput. Sci. 14(2), 195–208 (1981)
Thérien, D.: Two-sided wreath product of categories. J. Pure Appl. Algebra 74(3), 307–315 (1991)
Thérien, D., Wilke, Th.: Over words, two variables are as powerful as one quantifier alternation. In: Proceedings of STOC 1998, pp 234–240. ACM Press (1998)
Thomas, W.: Classifying regular events in symbolic logic. J. Comput. Syst. Sci. 25, 360–376 (1982)
Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates. Dokl. Akad. Nauk SSSR 140, 326–329 (1961). in Russian
Weil, P.: Closure of varieties of languages under products with counter. J. Comput. Syst. Sci. 45(3), 316–339 (1992)
Weis, Ph., Immerman, N.: Structure theorem and strict alternation hierarchy for FO2 on words. Log. Methods Comput. Sci. 5(3), 1–23 (2009)
Acknowledgments
This work was supported by the German Research Foundation (DFG) under grant DI 435/5-2.
Author information
Authors and Affiliations
Corresponding author
Additional information
This is the revised full version of a conference paper at CSR 2014 [8].
Rights and permissions
About this article
Cite this article
Fleischer, L., Kufleitner, M. & Lauser, A. The Half-Levels of the FO2 Alternation Hierarchy. Theory Comput Syst 61, 352–370 (2017). https://doi.org/10.1007/s00224-016-9712-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-016-9712-2