Abstract
The variety DA of finite monoids has a huge number of different characterizations, ranging from two-variable first-order logic FO2 to unambiguous polynomials. In order to study the structure of the subvarieties of DA, Trotter and Weil considered the intersection of varieties of finite monoids with bands, i.e., with idempotent monoids. The varieties of idempotent monoids are very well understood and fully classified. Trotter and Weil showed that for every band variety V there exists a unique maximal variety W inside DA such that the intersection with bands yields the given band variety V. These maximal varieties W define the Trotter-Weil hierarchy. This hierarchy is infinite and it exhausts DA; induced by band varieties, it naturally has a zigzag shape. In their paper, Trotter and Weil have shown that the corners and the intersection levels of this hierarchy are decidable.
In this paper, we give a single identity of omega-terms for every join level of the Trotter-Weil hierarchy; this yields decidability. Moreover, we show that the join levels and the subsequent intersection levels do not coincide. Almeida and Azevedo have shown that the join of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial finite monoids is decidable; this is the first non-trivial join level of the Trotter-Weil hierarchy. We extend this result to the other join levels of the Trotter-Weil hierarchy. At the end of the paper, we give two applications. First, we show that the hierarchy of deterministic and codeterministic products is decidable. And second, we show that the direction alternation depth of unambiguous interval logic is decidable.
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 (1994)
Almeida, J., Azevedo, A.: The join of the pseudovarieties of \(\mathcal{R}\)-trivial and \(\mathcal{L}\)-trivial monoids. J. Pure Appl. Algebra 60, 129–137 (1989)
Birjukov, P.A.: Varieties of idempotent semigroups. Algebra Logika 9, 255–273 (1970)
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)
Eilenberg, S.: Automata, Languages, and Machines, vol. B. Academic Press (1976)
Fennemore, C.F.: All varieties of bands I, II. Math. Nachr. 48, 237–262 (1971)
Gerhard, J.A.: The lattice of equational classes of idempotent semigroups. J. Algebra 15, 195–224 (1970)
Gerhard, J.A., Petrich, M.: Varieties of bands revisited. Proc. Lond. Math. Soc. 58(3), 323–350 (1989)
Krohn, K., Rhodes, J.L., Tilson, B.: Homomorphisms and semilocal theory. In: Algebraic Theory of Machines, Languages, and Semigroups, ch. 8, pp. 191–231. Academic Press (1968)
Kufleitner, M., Weil, P.: On the lattice of sub-pseudovarieties of DA. Semigroup Forum 81, 243–254 (2010)
Kufleitner, M., Weil, P.: The FO2 alternation hierarchy is decidable. arXiv, abs/1203.6152 (2012)
Kufleitner, M., Weil, P.: On logical hierarchies within FO2-definable languages. Log. Methods Comput. Sci. (in press, 2012)
Lodaya, K., Pandya, P.K., Shah, S.S.: Marking the chops: an unambiguous temporal logic. In: Proceedings of IFIP TCS 2008. IFIP, vol. 273, pp. 461–476. Springer (2008)
Pin, J.-É.: 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 (1986)
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)
Straubing, H.: Algebraic characterization of the alternation hierarchy in FO2[ < ] on finite words. In: Proceedings of CSL 2011. 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., Wilke, Th.: Over words, two variables are as powerful as one quantifier alternation. In: Proceedings of STOC 1998, pp. 234–240. ACM Press (1998)
Trotter, P., Weil, P.: The lattice of pseudovarieties of idempotent semigroups and a non-regular analogue. Algebra Univers. 37(4), 491–526 (1997)
Weis, Ph., Immerman, N.: Structure theorem and strict alternation hierarchy for FO2 on words. Log. Methods Comput. Sci. 5, 1–23 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kufleitner, M., Lauser, A. (2012). The Join Levels of the Trotter-Weil Hierarchy Are Decidable. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-32589-2_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32588-5
Online ISBN: 978-3-642-32589-2
eBook Packages: Computer ScienceComputer Science (R0)