Skip to main content

Groups, Languages and Dendric Shifts

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2018)

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

Included in the following conference series:

Abstract

We present a survey of results obtained on symbolic dynamical systems called dendric shifts. We state and sketch the proofs (sometimes new ones) of the main results obtained on these shifts. This includes the Return Theorem and the Finite Index Basis Theorem which both put in evidence the central role played by free groups in these systems. We also present a series of applications of these results, including some on profinite semigroups and some on dimension groups.

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

Access this chapter

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 EPUB and 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

References

  1. Almeida, J.: Profinite groups associated with weakly primitive substitutions. Fundam. Prikl. Mat. 11(3), 13–48 (2005)

    MATH  Google Scholar 

  2. Almeida, J., Costa, A.: A geometric interpretation of the Schützenberger group of a minimal subshift. Ark. Mat. 54(2), 243–275 (2016)

    Article  MathSciNet  Google Scholar 

  3. Arnoux, P., Rauzy, G.: Représentation géométrique de suites de complexité \(2n+1\). Bull. Soc. Math. France 119(2), 199–215 (1991)

    Article  MathSciNet  Google Scholar 

  4. Balková, L., Pelantová, E., Steiner, W.: Sequences with constant number of return words. Monatsh. Math. 155(3–4), 251–263 (2008)

    Article  MathSciNet  Google Scholar 

  5. Berstel, J., De Felice, C., Perrin, D., Reutenauer, C., Rindone, G.: Bifix codes and Sturmian words. J. Algebra 369, 146–202 (2012)

    Article  MathSciNet  Google Scholar 

  6. Berthé, V., et al.: Dimension groups of dendric shifts (2018, preprint)

    Google Scholar 

  7. Berthé, V., et al.: Acyclic, connected and tree sets. Monatsh. Math. 176(4), 521–550 (2015)

    Article  MathSciNet  Google Scholar 

  8. Berthé, V., et al.: The finite index basis property. J. Pure Appl. Algebra 219, 2521–2537 (2015)

    Article  MathSciNet  Google Scholar 

  9. Berthé, V., et al.: Maximal bifix decoding. Discrete Math. 338(5), 725–742 (2015)

    Article  MathSciNet  Google Scholar 

  10. Berthé, V., Rigo, M. (eds.): Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and its Applications, vol. 135. Cambridge University Press, Cambridge (2010)

    MATH  Google Scholar 

  11. Davidson, K.R.: \(C^*\)-Algebras by Example. Fields Institute Monographs, vol. 6. American Mathematical Society, Providence (1996)

    MATH  Google Scholar 

  12. Dolce, F., Perrin, D.: Neutral and tree sets of arbitrary characteristic. Theor. Comput. Sci. 658, 159–174 (2017)

    Article  MathSciNet  Google Scholar 

  13. Durand, F.: A characterization of substitutive sequences using return words. Discrete Math. 179(1–3), 89–101 (1998)

    Article  MathSciNet  Google Scholar 

  14. Durand, F., Host, B., Skau, C.: Substitutional dynamical systems, Bratteli diagrams and dimension groups. Ergod. Theory Dyn. Syst. 19(4), 953–993 (1999)

    Article  MathSciNet  Google Scholar 

  15. Fogg, N.P.: Substitutions in Dynamics, Arithmetics and Combinatorics. LNM, vol. 1794. Springer, Berlin (2002). https://doi.org/10.1007/b13861. Berthé, V., Ferenczi, S., Mauduit, C., Siegel, A. (eds.)

    Book  MATH  Google Scholar 

  16. Giordano, T., Putnam, I.F., Skau, C.F.: Topological orbit equivalence and \(C^*\)-crossed products. J. Reine Angew. Math. 469, 51–111 (1995)

    MathSciNet  MATH  Google Scholar 

  17. Justin, J., Vuillon, L.: Return words in Sturmian and episturmian words. Theor. Inf. Appl. 34(5), 343–356 (2000)

    Article  MathSciNet  Google Scholar 

  18. Tan, B., Wen, Z.-X., Zhang, Y.: The structure of invertible substitutions on a three-letter alphabet. Adv. Appl. Math. 32(4), 736–753 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

The results presented in this paper have been obtained through a cooperation with a group including Valérie Berthé, Paulina Cecchi, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Fabien Durand, Julien Leroy, Samuel Petite, Christophe Reutenauer and Giuseppina Rindone. They are gratefully acknowledged for their help in the preparation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dominique Perrin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Perrin, D. (2018). Groups, Languages and Dendric Shifts. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98654-8_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98653-1

  • Online ISBN: 978-3-319-98654-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics