Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Coding Non-orientable Laminations

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

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

  • 1401 Accesses

Abstract

Surface laminations are classic closed sets of disjoint curves in surfaces. We give here a full description of how to obtain codings of such laminations when they are non-orientable by using lamination languages, i.e. specific linear complexity languages of two-way infinite words. We also compare lamination languages with symbolic laminations, i.e. the coding counterparts of algebraic laminations.

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. Belov, A.Y., Chernyatiev, A.L.: Describing the set of words generated by interval exchange transformation. Comm. Algebra 38(7), 2588–2605 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  2. Berthé, V., Delecroix, V., Dolce, F., Perrin, D., Reutenauer, C., Rindone, G.: Natural coding of linear involutions (2014), arXiv:1405.3529 (see also the abstracts of the 15th Mons Theoretical Computer Science Days)

  3. Birman, J., Series, C.: Geodesics with bounded intersection number on surfaces are sparsely distributed. Topology 24(2), 217–225 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bonahon, F.: Geodesic laminations on surfaces. In: Laminations and foliations in dynamics, geometry and topology, Contemp. Math., vol. 269, pp. 1–37. Amer. Math. Soc. (2001)

    Google Scholar 

  5. Cassaigne, J., Nicolas, F.: Factor complexity. In: Combinatorics, automata and number theory, Encyclopedia Math. Appl., vol. 135, pp. 163–247. Cambridge Unversity Press, Cambridge (2010)

    Google Scholar 

  6. Casson, A., Bleiler, S.: Automorphisms of surfaces after Nielsen and Thurston, London Mathematical Society Student Texts, vol. 9. Cambridge Unversity Press, Cambridge (1988)

    Book  Google Scholar 

  7. Cornfeld, I.P., Fomin, S.V., Sinaĭ, Y.G.: Ergodic theory, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 245. Springer, New York (1982)

    Google Scholar 

  8. Coulbois, T., Hilion, A., Lustig, M.: R-trees and laminations for free groups I: Algebraic laminations. J. Lond. Math. Soc. 78(2), 723–736 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Danthony, C., Nogueira, A.: Measured foliations on nonorientable surfaces. Ann. Sci. École Norm. Sup. (4) 23(3), 469–494 (1990)

    Google Scholar 

  10. Ferenczi, S., Zamboni, L.Q.: Languages of \(k\)-interval exchange transformations. Bull. Lond. Math. Soc. 40(4), 705–714 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gadre, V.S.: Dynamics of non-classical interval exchanges. Ergodic Theory Dynam. Systems 32(6), 1930–1971 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lando, S.K., Zvonkin, A.K.: Graphs on surfaces and their applications, Encyclopaedia of Mathematical Sciences, vol. 141. Springer, Berlin (2004)

    Book  Google Scholar 

  13. Lee, J.M.: Introduction to smooth manifolds, Graduate Texts in Mathematics, vol. 218, 2nd edn. Springer, New York (2013)

    Google Scholar 

  14. Lopez, L.M., Narbel, P.: Lamination languages. Ergodic Theory Dynam. Systems 33(6), 1813–1863 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  15. Narbel, P.: Bouquets of circles for lamination languages and complexities. RAIRO, Theoretical Informatics and Applications 48(4), 391–418 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  16. Penner, R., Harer, J.: Combinatorics of train tracks, Annals of Mathematics Studies, vol. 125. Princeton University Press, Princeton (1992)

    Google Scholar 

  17. Spanier, E.H.: Algebraic topology. Springer, New York (1981)

    Book  Google Scholar 

  18. Thurston, W.: The geometry and topology of three-manifolds (Princeton University Lecture Notes) (Electronic version 1.1 - March 2002). http://library.msri.org/books/gt3m (1980) (accessed September 2014)

Download references

Author information

Authors and Affiliations

  1. Tokyo University of Social Welfare, Gunma, 372-0831, Japan

    Luis-Miguel Lopez

  2. LaBRI, University of Bordeaux, 33405, Talence, France

    Philippe Narbel

Authors
  1. Luis-Miguel Lopez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Narbel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Philippe Narbel .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Nice Sophia Antipolis University, Sophia Antipolis, France

    Enrico Formenti

  3. Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus-Liebig-Universität, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lopez, LM., Narbel, P. (2015). Coding Non-orientable Laminations. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation