Skip to main content
Conference Proceedings

Boundedness of monadic second-order formulae over finite words

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5556 LNCS(PART 2) 67-78
DOI: 10.1007/978-3-642-02930-1_6
6Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that the boundedness problem for monadic second-order logic over the class of all finite words is decidable. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Blumensath, A., Otto, M., & Weyer, M. (2009). Boundedness of monadic second-order formulae over finite words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5556 LNCS, pp. 67–78). https://doi.org/10.1007/978-3-642-02930-1_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free