Abstract
In this paper we consider the class of all regular languages definable by the extended majority quantifier and the order predicate but using only two variables. The main part of the paper is the presentation of a geometric method which is used to show that a given regular language cannot be defined by such formulas. Applying this method we can give a necessary condition in terms of an equation as well as an upper and a lower bound for the corresponding class of monoids. As a consequence we obtain that FO + MAJ2[ < ] does not contain FO + MOD2[ < ].
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
Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston (1994)
Tesson, P., Thérien, D.: Logic meets algebra: the case of regular languages. Logical Methods in Computer Science 3 (2007)
Barrington, D.A.M.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38, 150–164 (1989)
Allender, E., Koucký, M.: Amplifying lower bounds by means of self-reducibility. In: IEEE Conference on Computational Complexity, pp. 31–40 (2008)
Behle, C., Krebs, A., Mercer, M.: Linear circuits, two-variable logic and weakly blocked monoids. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 147–158. Springer, Heidelberg (2007)
Pin, J.E.: Varieties of formal languages. Plenum, London (1986)
Howie, J.M.: Fundamentals of Semigroup Theory. Clarendon Press, Oxford (1995)
Thérien, D., Wilke, T.: Nesting until and since in linear temporal logic. Theory Comput. Syst. 37, 111–131 (2004)
Tesson, P., Thérien, D.: The computing power of programs over finite monoids. Electronic Colloquium on Computational Complexity (ECCC) 8 (2001)
Straubing, H., Thérien, D.: Regular languages defined by generalized first-order formulas with a bounded number of bound variables. Theory Comput. Syst. 36, 29–69 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Behle, C., Krebs, A., Reifferscheid, S. (2009). Regular Languages Definable by Majority Quantifiers with Two Variables. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)