Abstract
We obtain a logical characterization of an important class of regular languages, denoted \({\mathcal DO}\), and of its most important subclasses in terms of two-variable sentences with ordinary and modular quantifiers but in which all modular quantifiers lie outside the scope of ordinary quantifiers. The result stems from a new decomposition of the variety of monoids DO in terms of iterated block products.
This decomposition and the ensuing logical characterization allows us to shed new light on recent results on regular languages which are recognized by bounded-depth circuits with a linear number of wires and regular languages with small communication complexity.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Almeida, J., Weil, P.: Profinite categories and semidirect products. J. Pure and Applied Algebra 123, 1–50 (1998)
Bilardi, G., Preparata, F.: Characterization of associative operations with prefix circuits of constant depth and linear size. SIAM J. Comput. 19(2), 246–255 (1990)
Immerman, N., Kozen, D.: Definability with a bounded number of bound variables. Information and Computation 83(2), 121–139 (1989)
Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Berkeley (1968)
Koucký, M., Pudlák, P., Thérien, D.: Bounded-depth circuits: separating wires from gates. In: Symposium on Theory of Computing (STOC 2005), 2005
McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G. (ed.) Handbook of language theory, ch. 10, vol. 1, pp. 679–746. Springer, Heidelberg (1997)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control 8(2), 190–194 (1965)
Straubing, H.: Finite Automata, Formal Logic and Circuit Complexity. Birkhauser, Boston (1994)
Straubing, H.: On the logical description of regular languages. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, p. 528. Springer, Heidelberg (2002)
Straubing, H., Thérien, D.: Weakly iterated block products of finite monoids. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, p. 91. Springer, Heidelberg (2002)
Straubing, H., Thérien, D.: Regular languages defined by generalized first-order formulas with a bounded number of bound variables. Theory of Computing Systems 36(1), 29–69 (2003)
Straubing, H., Thérien, D., Thomas, W.: Regular languages defined by generalized quantifiers. Information and Computation 118, 289–301 (1995)
Tesson, P.: Computational Complexity Questions Related to Finite Monoids and Semigroups. PhD thesis, McGill University (2003)
Tesson, P., Thérien, D.: Complete classifications for the communication complexity of regular languages. Theory of Comput. Syst. (2004) (to appear)
Thérien, D., Wilke, T.: Over words, two variables are as powerful as one quantifier alternation. In: Proc. 30th ACM Symposium on the Theory of Computing, pp. 256–263 (1998)
Thérien, D., Wilke, T.: Nesting until and since in linear temporal logic. Theory Comput. Syst. 37(1), 111–131 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tesson, P., Thérien, D. (2005). Restricted Two-Variable FO + MOD Sentences, Circuits and Communication Complexity. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_43
Download citation
DOI: https://doi.org/10.1007/11523468_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)