Skip to main content
Log in

On continued fractions and finite automata

  • Published:
Mathematische Annalen Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Detlovs, V. K.: Equivalence of normal algorithms and recursive functions. (Russian). Trudy Mat. Inst. Steklov.52, 75–139 (1958)

    Google Scholar 

  2. Hall, M.: On the sum and product of continued fractions. Ann. of Math.48, 966–993 (1947)

    Google Scholar 

  3. Hurwitz, A.: Über die Kettenbruch-Entwicklung der Zahl e. Phys.-ökon. Ges., Königsberg (1891). Mathematische Werke, Bd. 2, 129–133, Basel: Birkhäuser 1933

    Google Scholar 

  4. Hurwitz, A.: Über die angenäherte Darstellungen der Zahlen durch rationale Brüche. Math. Ann.44, 417–436 (1894)

    Google Scholar 

  5. Raney, G. N.: Generalization of the Fibonacci sequence ton dimensions. Canad. J. Math.18, 332–349 (1966)

    Google Scholar 

  6. Salomaa, A.: Theory of Automata. (International Series of Monographs in Pure and Applied Mathematics, vol. 100.) Oxford: Pergamon Press, 1969

    Google Scholar 

  7. Sanov, I. N.: A property of a representation of a free group. (Russian). Doklady Akad. Nauk SSSR57, 657–659 (1947)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raney, G.N. On continued fractions and finite automata. Math. Ann. 206, 265–283 (1973). https://doi.org/10.1007/BF01355980

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation