Abstract
In formulas of monadic second-order logic (MSO), quantifiers range over sets of elements or over elements of the universe of some finite structure.
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
M. Ajtai, R. Fagin, and L.J. Stockmeyer. The closure of monadic NP. Research Report RJ 10092, IBM, Dec 1997.
M. Ajtai, R. Fagin, and L.J. Stockmeyer. The closure of monadic NP. In The Thirtieth Annual ACM Symposium on Theory of Computing, pages 309–318. SIGACT, 1998.
J.A. Brzozowski and R. Knast. The dot-depth hierarchy of star-free languages is infinite. Journal of Computer and System Sciences, 5:1–16, 1971.
H.D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, New York, 1995.
R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R.M. Karp, editor, Complexity of Computation, volume 7 of SIAM-Proceedings, pages 43–73. AMS, 1974.
R. Fagin. Monadic generalized spectra. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:89–96, 1975.
R. Fagin, L.J. Stockmeyer, and M.Y. Vardi. On monadic NP vs. monadic co-NP. Information and Computation, 120:78–92, 1995.
D. Giammarresi and A. Restivo. Two-dimensional languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 125–267. Springer-Verlag, New York, 1996.
O. Matz. On piecewise testable, starfree, and recognizable picture languages. In Maurice Nivat, editor, Foundations of Software Science and Computation Structures, volume 1378 of Lecture Notes in Computer Science, pages 203–210. Springer, 1998.
O. Matz. Dot-depth and monadic quantifier alternation over pictures. Aachener Informatik-Berichte 99–08, RWTH Aachen, Ahornstr. 55, D-52074 Aachen, 1999.
J.A. Makowsky and Y.B. Pnueli. Arity and alternation in second-order logic. Annals of Pure and Applied Logic, 78(1–3):189–202, 1996.
O. Matz and W. Thomas. The monadic quantifier alternation hierarchy over graphs is infinite. In Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 236–244, Warsaw, Poland, 1997. IEEE.
N. Schweikardt. The monadic quantifier alternation hierarchy over grids and pictures. In Mogens Nielson and Wolfgang Thomas, editors, Computer Science Logic, volume 1414 of Lecture Notes in Computer Science, pages 441–460. Springer, 1997.
Th. Wilke. Star-free picture expressions are strictly weaker than first-order logic. In Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, volume 1256, pages 347–357. Springer, Bologna, Italy, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 B. G. Teubner GmbH, Stuttgart/Leipzig/Wiesbaden
About this chapter
Cite this chapter
Matz, O. (2000). Dot-Depth and Monadic Quantifier Alternation over Pictures — Extended Abstract. In: Fiedler, H., et al. Ausgezeichnete Informatikdissertationen 1999. GI-Dissertationspreis. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-84823-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-322-84823-9_16
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-519-02650-1
Online ISBN: 978-3-322-84823-9
eBook Packages: Springer Book Archive