Skip to main content

Automaticity of Solutions of Mahler Equations

  • Conference paper
Sequences and their Applications

Abstract

We give sufficient criteria for the m-automaticity of the coefficients of formal power series satisfying special Mahler equations over finite commutative rings as well as over finite fields of any characteristic. The main tool for our investigation will be the m-equation-kernel of a rational function. We show that there is a close relation between the finiteness of an m-equation-kernel and the finiteness of the m-kernel of a solution.

Supported by DFG-Graduiertenkolleg “Komplexe Dynamische Systeme”

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. J.-P. Allouche. Automates finis en théorie des nombres. Expo. Math, 5:239–266, 1987.

    MathSciNet  MATH  Google Scholar 

  2. A. Barbé,H.-O. Peitgenand G. Skordev. Automaticity of coarse-graining invariant orbits of one-dimensional linear cellular automata. International Journal of Bifurcation and Chaos, 9(1), 1999. To appear.

    Article  Google Scholar 

  3. P.-G. Becker. k-regular power series and Mahler-type functional equations. J. Number Theory, 49:269–286, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  4. G. Christol. Ensembles presque périodiques k -reconnaissables. Theoret. Comput. Sei., 9:141–145, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  5. G. Christol, T. Kamae, M. Mendès France, and G. Rauzy. Suites algébriques, automates et substitutions. Bull. Soc. Math. France, 108:401–419, 1980.

    MathSciNet  MATH  Google Scholar 

  6. A. Cobham. Uniform tag sequences. Math. Systems Theory, 6:164–192, 1972.

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Dumas. Algebraic aspects of B-regular series. In A. Lingas, R. Karlsson, and S. Carlsson, editors, Automata, Languages and Programming, volume 700 of Lect. Notes Comput. Sci., pages 457–468. Springer-Verlag, 1993. Proceedings of the 20th International Colloquium ICALP 93, Lund, Sweden.

    Google Scholar 

  8. S. W. Golomb. Shift Register Sequences. Holden-Day, San Francisco, 1967.

    MATH  Google Scholar 

  9. F. von Haeseler. On algebraic properties of sequences generated by substitutions over a group. Habilitationsschrift, University of Bremen, 1995.

    Google Scholar 

  10. R. Lidl and H. Niederreiter. Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications. Addison-Wesley, 1983.

    Google Scholar 

  11. H Niederreiter. A simple and general approach to the decimation of feedback shift-register sequences. Problems Control Inform. Theory, 17:327–331, 1988.

    MathSciNet  MATH  Google Scholar 

  12. A. J. van der Poorten. Substitution automata, functional equations and “functions algebraic over a finite field”. Contemp. Math., 9:307–312, 1982.

    Article  MATH  Google Scholar 

  13. B. Randé. Équations fonctionelles de Mahler et fonctions élémentaires. Groupe de travail en Théorie Analytique des Nombres, Paris, 1991. see also Thèse, Université de Bordeaux, 1992.

    Google Scholar 

  14. O. Salon. Suites automatique à multi-indices. Séminaire de Théorie des Nombres de Bordeaux, 4:4.01–4.27, 1986–1987. Followed by an Appendix by J. Shallit, 4.29A-4.36A.

    Google Scholar 

  15. N. Zierler. Linear recurring sequences. J. Soc. Indust. Appl. Math., 7:31–48, 1959.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London

About this paper

Cite this paper

Von Haeseler, F., Jürgensen, W. (1999). Automaticity of Solutions of Mahler Equations. In: Ding, C., Helleseth, T., Niederreiter, H. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0551-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0551-0_16

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-196-2

  • Online ISBN: 978-1-4471-0551-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics