Skip to main content

A simple proof of the Skolem-Mahler-Lech theorem

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 194))

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. BERSTEL et C. REUTENAUER, Les séries rationnelles et leurs languages, Masson, Paris 1984.

    Google Scholar 

  2. C. LECH, A note on recurring series, Arkiv for Matematik, Band 2 nr22, (1953), p. 417–421.

    Google Scholar 

  3. K. MAHLER, Eine arithmetische Eigenschaft der Taylor coefficienten rationaler Funktionen Proc. Acad.Sci.Amst. 38(1935) p.51–60.

    Google Scholar 

  4. K. MAHLER, On the Taylor coefficients of rational functions, Proc. Cambridge Philos. Soc. 52 (1956) p 39–48.

    Google Scholar 

  5. T. SKOLEM, Skr. norske Videns Akad (1933) no6.

    Google Scholar 

  6. M.P. SCHUTZENBERGER, On the definition of a family of automata, Information and Control 4, (1961) p 245–270.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hansel, G. (1985). A simple proof of the Skolem-Mahler-Lech theorem. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015749

Download citation

  • DOI: https://doi.org/10.1007/BFb0015749

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15650-5

  • Online ISBN: 978-3-540-39557-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics