Skip to main content
SpringerLink
Log in

Subshifts, Languages and Logic

  • Conference paper
Developments in Language Theory (DLT 2009)

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

Included in the following conference series:

Abstract

We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tilings. Conversely, we characterise logic fragments corresponding to various classes of infinite pictures (subshifts of finite type, sofic subshifts).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Altenbernd, J.-H., Thomas, W., Wohrle, S.: Tiling systems over infinite pictures and their acceptance conditions. In: Developments in Language Theory (2003)

    Google Scholar 

  2. Ballier, A., Jeandel, E.: Tilings and model theory. In: First Symposium on Cellular Automata Journées Automates Cellulaires (2008)

    Google Scholar 

  3. Berger, R.: The undecidability of the domino problem. Memoirs American Mathematical Society 66, 1966 (1966)

    MathSciNet  MATH  Google Scholar 

  4. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer Monographs in Mathematics. Springer, Berlin (1995)

    MATH  Google Scholar 

  5. Börger, Y.G.E., Grädel, E.: The classical decision problem. Springer, Telos (1996)

    MATH  Google Scholar 

  6. Giammarresi, D., Restivo, A.: Two-Dimensional Languages. In: Handbook of Formal Languages, Beyond Words, vol. 3. Springer, Heidelberg (1997)

    Google Scholar 

  7. Giammarresi, D., Restivo, A., Seibert, S., Thomas, W.: Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems. Information and Computation 125, 32–45 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hanf, W.: Model-theoretic methods in the study of elementary logic. In: Symposium in the Theory of Models, pp. 132–145 (1965)

    Google Scholar 

  9. Harel, D.: Recurring Dominoes: Making the Highly Undecidable Highly Understandable. Annals of Discrete Mathematics 24, 51–72 (1985)

    MathSciNet  MATH  Google Scholar 

  10. Kuske, D., Lohrey, M.: Logical aspects of Cayley-graphs: the group case. Annals of Pure and Applied Logic 131(1-3), 263–286 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Libkin, L.: Elements of Finite Model Theory. Texts in Theoretical Computer Science, an EATCS Series. Springer, Heidelberg (2004)

    Book  MATH  Google Scholar 

  12. Makowsky, J.A.: On some conjectures connected with complete sentences. Fund. Math. 81, 193–202 (1974)

    MathSciNet  MATH  Google Scholar 

  13. Matz, O., Schweikardt, N.: Expressive power of monadic logics on words, trees, pictures, and graphs. In: Gradel, E., Flum, J., Wilke, T. (eds.) Logic and Automata: History and Perspectives. Texts in Logic and Games, pp. 531–552. Amsterdam University Press (2007)

    Google Scholar 

  14. Oger, F.: Algebraic and model-theoretic properties of tilings. Theoretical computer science 319, 103–126 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Poizat, B.: Une théorie finiement axiomatisable et superstable. Groupe d’étude des théories stables 3(1), 1–9 (1980-1882)

    MATH  Google Scholar 

  16. Robinson, R.M.: Undecidability and Nonperiodicity for Tilings of the Plane. Inventiones Math. 12 (1971)

    Google Scholar 

  17. Schwentick, T., Barthelmann, K.: Local Normal Forms for First-Order Logic with Applications to Games and Automata. Discrete Mathematics and Theoretical Computer Science 3, 109–124 (1999)

    MathSciNet  MATH  Google Scholar 

  18. Seese, D.: The structure of the models of decidable monadic theories of graphs. Annals of pure and applied logic 53(2), 169–195 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  19. Thomas, W.: On logics, tilings, and automata. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 441–454. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  20. Thomas, W.: Languages, Automata, and Logic. In: Thomas, W. (ed.) Handbook of Formal Languages, Beyond Words, vol. 3. Springer, Heidelberg (1997)

    Google Scholar 

  21. Wang, H.: Proving theorems by pattern recognition ii. Bell system technical journal 40, 1–41 (1961)

    Article  Google Scholar 

  22. Weiss, B.: Subshifts of finite type and sofic systems. Monatshefte für Mathematik 77, 462–474 (1973)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’informatique fondamentale de Marseille (LIF), Aix-Marseille Université, CNRS, 39 rue Joliot-Curie, 13 453, Marseille Cedex 13, France

    Emmanuel Jeandel

  2. LAMA (Université de Savoie, CNRS), Campus Scientifique, 73376, Le Bourget-du-lac cedex, France

    Guillaume Theyssier

Authors
  1. Emmanuel Jeandel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guillaume Theyssier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Formale Methoden der Informatik, FMI, Universität Stuttgart, Universitätsstrasse 38, 70569, Stuttgart, Germany

    Volker Diekert  & Dirk Nowotka  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jeandel, E., Theyssier, G. (2009). Subshifts, Languages and Logic. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02737-6_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02736-9

  • Online ISBN: 978-3-642-02737-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation