Abstract
This is a survey about a collection of results about a (double) hierarchy of classes of regular languages, which occurs in a natural fashion in a number of contexts. One of these occurrences is given by an alternated sequence of deterministic and co-deterministic closure operations, starting with the piecewise testable languages. Since these closure operations preserve varieties of languages, this defines a hierarchy of varieties, and through Eilenberg’s variety theorem, a hierarchy of pseudo-varieties (classes of finite monoids that are defined by pesudo-identities). The point of this excursion through algebra is that it provides reasonably simple decision algorithms for the membership problem in the corresponding varieties of languages. Another interesting point is that the hierarchy of pseudo-varieties bears a formal resemblance with another hierarchy, the hierarchy of varieties of idempotent monoids, which was much studied in the 1970s and 1980s and is by now well understood. This resemblance provides keys to a combinatorial characterization of the different levels of our hierarchies, which turn out to be closely related with the so-called rankers, a specification mechanism which was introduced to investigate the two-variable fragment of the first-order theory of the linear order. And indeed the union of the varieties of languages which we consider coincides with the languages that can be defined in that fragment. Moreover, the quantifier alternation hierarchy within that logical fragment is exactly captured by our hierarchy of languages, thus establishing the decidability of the alternation hierarchy.
There are other combinatorial and algebraic approaches of the same logical hierarchy, and one recently introduced by Krebs and Straubing also establishes decidability. Yet the algebraic operations involved are seemingly very different, an intriguing problem…
This work was partially supported by the ANR through ANR-2010-BLAN-0204.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994)
Gerhard, J.: The lattice of equational classes of idempotent semigroups. Journal of Algebra 15, 195–224 (1970)
Gerhard, J., Petrich, M.: Varieties of bands revisited. Proceedings of the London Mathematical Society 58(3), 323–350 (1989)
Krebs, A., Straubing, H.: An effective characterization of the alternation hierarchy in two-variable logic. In: FSTTCS 2012. LIPIcs, vol. 18, pp. 86–98. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2012), doi:10.4230/LIPIcs.FSTTCS.2012.86
Krohn, K., Rhodes, J., Tilson, B.: Homomorphisms and semilocal theory. In: Arbib, M. (ed.) The Algebraic Theory of Machines, Languages and Semigroups. Academic Press (1965)
Kufleitner, M., Weil, P.: On the lattice of sub-pseudovarieties of DA. Semigroup Forum 81, 243–254 (2010)
Kufleitner, M., Weil, P.: The FO 2 alternation hierarchy is decidable. In: CSL 2012. LIPIcs, vol. 16, pp. 426–439. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2012), doi:10.4230/LIPIcs.CSL.2012.426
Kufleitner, M., Weil, P.: On logical hierarchies within FO 2-definable languages. Logical Methods in Computer Science 8(3:11), 1–30 (2012)
Pin, J.E.: Propriétés syntactiques du produit non ambigu. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 483–499. Springer, Heidelberg (1980)
Pin, J.É.: Varieties of Formal Languages. North Oxford Academic, London (1986)
Rhodes, J., Steinberg, B.: The \(\mathfrak{q}\)-theory of finite semigroups. Springer Monographs in Mathematics. Springer, New York (2009)
Schützenberger, M.P.: Sur le produit de concaténation non ambigu. Semigroup Forum 13, 47–75 (1976)
Schwentick, T., Thérien, D., Vollmer, H.: Partially-ordered two-way automata: A new characterization of DA. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 239–250. Springer, Heidelberg (2002)
Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975)
Straubing, H.: Finite automata, formal logic, and circuit complexity. Birkhäuser, Boston (1994)
Straubing, H.: Algebraic Characterization of the Alternation Hierarchy in FO 2[ < ] on Finite Words. In: CSL 2011. LIPIcs, vol. 12, pp. 525–537. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2011), doi:10.4230/LIPIcs.CSL.2011.525
Weil, P.: Some results on the dot-depth hierarchy. Semigroup Forum 46, 352–370 (1993)
Weis, P., Immerman, N.: Structure theorem and strict alternation hierarchy for FO2 on words. Logical Methods in Computer Science 5, 1–23 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Weil, P. (2014). From Algebra to Logic: There and Back Again The Story of a Hierarchy. In: Shur, A.M., Volkov, M.V. (eds) Developments in Language Theory. DLT 2014. Lecture Notes in Computer Science, vol 8633. Springer, Cham. https://doi.org/10.1007/978-3-319-09698-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-09698-8_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09697-1
Online ISBN: 978-3-319-09698-8
eBook Packages: Computer ScienceComputer Science (R0)