Skip to main content
SpringerLink
Log in

Regular Languages of Words over Countable Linear Orderings

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

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

Included in the following conference series:

Abstract

We develop an algebraic model for recognizing languages of words indexed by countable linear orderings. This notion of recognizability is effectively equivalent to definability in monadic second-order (MSO) logic. The proofs also imply the first known collapse result for MSO logic over countable linear orderings.

Supported by the Anr 2007 JCJC 0051 Jade and Anr 2010 Blan 0202 02 Frec.

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. Bedon, N., Bès, A., Carton, O., Rispal, C.: Logic and rational languages of words indexed by linear orderings. Theoretical Computer Science 46(4), 737–760 (2010)

    MATH  MathSciNet  Google Scholar 

  2. Bruyère, V., Carton, O.: Automata on linear orderings. Journal of Computer and System Sciences 73(1), 1–24 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Büchi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem, pp. 2–23. North Holland, Amsterdam (1964)

    Google Scholar 

  4. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress for Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford University Press, Stanford (1962)

    Google Scholar 

  5. Colcombet, T.: Factorisation forests for infinite words and applications to countable scattered linear orderings. Theoretical Computer Science 411, 751–764 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  6. Feferman, S., Vaught, R.: The first-order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57–103 (1959)

    MATH  MathSciNet  Google Scholar 

  7. Kechris, A.S.: Classical Descriptive Set Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1995)

    Book  MATH  Google Scholar 

  8. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1–35 (1969)

    MATH  MathSciNet  Google Scholar 

  9. Ramsey, F.P.: On a problem of formal logic. Proceedings of the London Mathematical Society 30, 264–286 (1929)

    MATH  MathSciNet  Google Scholar 

  10. Rispal, C., Carton, O.: Complementation of rational sets on countable scattered linear orderings. International Journal of Foundations of Computer Science 16(4), 767–786 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Rosenstein, J.G.: Linear Orderings. Academic Press, London (1982)

    MATH  Google Scholar 

  12. Shelah, S.: The monadic theory of order. Annals of Mathematics 102, 379–419 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  13. Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, vol. 3, pp. 389–455. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Paris Diderot, LIAFA, France

    Olivier Carton

  2. CNRS/LIAFA, France

    Thomas Colcombet

  3. Department of Computer Science, Oxford University, UK

    Gabriele Puppis

Authors
  1. Olivier Carton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Colcombet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gabriele Puppis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101, Reykjavik, Iceland

    Luca Aceto

  2. Fakultät für Informatik, Universität Wien, Universitätsstraße10/9, 1090, Wien, Österreich, Austria

    Monika Henzinger

  3. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00, Praha 1, Czech Republic

    Jiří Sgall

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carton, O., Colcombet, T., Puppis, G. (2011). Regular Languages of Words over Countable Linear Orderings. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22012-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22011-1

  • Online ISBN: 978-3-642-22012-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation