Abstract
By a well-known result due to Büchi and Trakhtenbrot, all monadic second-order sentences over words describe regular languages. In this paper, we investigate prefix classes of general second-order logic. Such a prefix class is called regular, if each of its sentences describes a regular language, and nonregular otherwise. Recently, the regular and nonregular prefix classes of existential second order logic (Σ1 1) were exhaustively determined. We briefly recall these results and continue this line of research by systematically investigating the syntactically more complex prefix classes Σ1 k(Q) of second-order logic for each integer k > 1 and for each first-order quantifier prefix Q. We give an exhaustive classification of the regular and nonregular prefix classes of this form, and derive of complexity results for the corresponding model checking problems. We also give a brief survey of recent results on the complexity of evaluating existential second-order logic over graphs, and a list of interesting open problems.
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
H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305–1317, 1996.
E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer, 1997.
J. R. Büchi. On a decision method in restriced second-order arithmetic. In E. Nagel et al., editor, Proc. International Congress on Logic, Methodology and Philosophy of Science, pp. 1–11, Stanford, CA, 1960. Stanford University Press.
J. R. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 6:66–92, 1960.
B. Courcelle. The monadic second-order logic of graphs I: recognizable sets of finite graphs. Information and Computation, 85:12–75, 1990.
H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.
T. Eiter, G. Gottlob, and Y. Gurevich. Normal forms for second-order logic over finite structures, and classification of NP optimization problems. Annals of Pure and Applied Logic, 78:111–125, 1996.
T. Eiter, G. Gottlob, and Y. Gurevich. Existential second-order logic over strings. Journal of the ACM, 47(1):77–131, 2000.
R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, pp. 43–74. AMS, 1974.
G. Gottlob, P. Kolaitis, and T. Schwentick. Existential second-order logic over graphs: charting the tractability frontier. In Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), pp. 664–674. IEEE Computer Society Press, 2000.
E. Grädel and E. Rosen. Two-variable descriptions of regularity. In Proc. 14th Annual Symposium on Logic in Computer Science (LICS-99), pp. 14–23. IEEE CS Press, 1999.
N. Immerman. Descriptive Complexity. Springer, 1997.
P. Kolaitis and C. Papadimitriou. Some computational aspects of circumscription. Journal of the ACM, 37(1):1–15, 1990.
D. Leivant. Descriptive characterizations of computational complexity. Journal of Computer and System Sciences, 39:51–83, 1989.
J.-E. Pin. Logic on words. Bulletin of the EATCS, 54:145–165, 1994.
L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Comp. Sc., 3:1–22, 1977.
H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, 1994.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4. Elsevier Science Pub., 1990.
C. Thomassen. On the presence of disjoint subgraphs of a specified type. Journal of Graph Theory, 12:1, 101–111, 1988.
B. Trakhtenbrot. Finite automata and the logic of monadic predicates. Dokl. Akad. Nauk SSSR, 140:326–329, 1961.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiter, T., Gottlob, G., Schwentick, T. (2002). Second-Order Logic over Strings: Regular and Non-regular Fragments. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_4
Download citation
DOI: https://doi.org/10.1007/3-540-46011-X_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43453-5
Online ISBN: 978-3-540-46011-4
eBook Packages: Springer Book Archive