Skip to main content
SpringerLink
Log in

Regular Geometrical Languages and Tiling the Plane

  • Conference paper
Implementation and Application of Automata (CIAA 2010)

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

Included in the following conference series:

Abstract

We show that if a binary language L is regular, prolongable and geometrical, then it can generate, on certain assumptions, a p1 type tiling of a part of ℕ2. We also show that the sequence of states that appear along a horizontal line in such a tiling only depends on the shape of the tiling sub-figure and is somehow periodic.

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. Baruah, S.K., Rosier, L.E., Howell, R.R.: Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems 2(4), 301–324 (1990)

    Article  Google Scholar 

  2. Beauquier, D., Nivat, M.: On translating one polyomino to tile the plane. Discrete & Computational Geometry 6, 575–592 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blanpain, B., Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: Geometrical languages. In: Martin Vide, C. (ed.) International Conference on Language Theory and Automata (LATA 2007), vol. 35/07, GRLMC Universitat Rovira I Virgili (2007)

    Google Scholar 

  4. Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: Geometricity of binary regular languages. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 178–189. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: An efficient algorithm to test whether a binary and prolongeable regular language is geometrical. Int. J. Found. Comput. Sci. 20(4), 763–774 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Eilenberg, S.: Automata, languages and machines, vol. B. Academic Press, New York (1976)

    MATH  Google Scholar 

  7. Geniet, D., Largeteau, G.: Wcet free time analysis of hard real-time systems on multiprocessors: A regular language-based model. Theor. Comput. Sci. 388(1-3), 26–52 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Golomb, S.W.: Polyominoes: Puzzles, patterns, problems, and packings. Princeton Academic Press, London (1996)

    MATH  Google Scholar 

  9. Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies, Ann. Math. Studies 34, 3–41 (1956)

    MathSciNet  Google Scholar 

  10. Largeteau-Skapin, G., Geniet, D., Andres, E.: Discrete geometry applied in hard real-time systems validation. In: Andrès, É., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol. 3429, pp. 23–33. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Lungo, A.D.: Polyominoes defined by two vectors. Theor. Comput. Sci. 127(1), 187–198 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Myhill, J.: Finite automata and the representation of events. WADD TR-57-624, 112–137 (1957)

    Google Scholar 

  13. Nerode, A.: Linear automata transformation. In: Proceedings of AMS, vol. 9, pp. 541–544 (1958)

    Google Scholar 

  14. Parikh, R.: On context-free languages. J. ACM 13(4), 570–581 (1966)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITIS, University of Rouen, France

    Jean-Marc Champarnaud, Jean-Philippe Dubernard & Hadrien Jeanne

Authors
  1. Jean-Marc Champarnaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Philippe Dubernard
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hadrien Jeanne
    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 Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Champarnaud, JM., Dubernard, JP., Jeanne, H. (2011). Regular Geometrical Languages and Tiling the Plane. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18098-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18097-2

  • Online ISBN: 978-3-642-18098-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation