Skip to main content
SpringerLink
Log in

Boundedness of Monadic Second-Order Formulae over Finite Words

  • Conference paper
Automata, Languages and Programming (ICALP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5556))

Included in the following conference series:

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise, J., Moschovakis, Y.N.: Global inductive definability. The Journal of Symbolic Logic 43, 521–534 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  2. Colcombet, T., Löding, C.: The nesting-depth of disjunctive μ-calculus for tree languages and the limitedness problem. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 416–430. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs. In: Proc. 20th Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 477–490 (1988)

    Google Scholar 

  4. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  5. Hashiguchi, K.: Improved limitedness theorems on finite automata with distance functions. Theoretical Computer Science 72, 72–78 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hillebrand, G., Kanellakis, P., Mairson, H., Vardi, M.: Undecidable boundedness problems for datalog programs. The Journal of Logic Programming 25, 163–190 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kreutzer, S., Otto, M., Schweikardt, N.: Boundedness of monadic FO over acyclic structures. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 571–582. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Leung, H., Podolskiy, V.: The limitedness problem on distance automata: Hashiguchi’s method revisited. Theoretical Computer Science 310, 147–158 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Otto, M.: Eliminating recursion in the μ-calculus. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 531–540. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Otto, M.: The boundedness problem for monadic universal first-order logic. In: Proc. 21th IEEE Symposium on Logic in Computer Science, LICS 2006, pp. 37–46 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Technische Universität Darmstadt, Germany

    Achim Blumensath & Martin Otto

  2. Lehrstuhl Logik in der Informatik, Humboldt-Universität zu Berlin, Germany

    Mark Weyer

Authors
  1. Achim Blumensath
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mark Weyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Freiburg, Georges Köhler Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Department of Computer and Systems Sciences, Sapienza University of Rome, Via Ariosto 25, 00184, Roma, Italy

    Alberto Marchetti-Spaccamela

  3. Tel Aviv University Google R&D Center, School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Yossi Matias

  4. University of Patras and CTI, N. Kazantzaki Street 1, 26504, Rion, Patras, Greece

    Sotiris Nikoletseas

  5. RWTH Aachen, Lehrstuhl Informatik 7, Ahornstraße 55, 52056, Aachen, Germany

    Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blumensath, A., Otto, M., Weyer, M. (2009). Boundedness of Monadic Second-Order Formulae over Finite Words. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02930-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02930-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02929-5

  • Online ISBN: 978-3-642-02930-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation