Advertisement

Linear numeration systems, θ-developments and finite automata

  • Christiane Frougny
Contributed Papers Automata Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 349)

Abstract

In numeration systems defined by a linear recurrence relation, as well as in the set of developments of numbers in a non integer basis ϑ, we define the notion of normal representation of a number. We show that, taking for ϑ the greatest root of the characteristic polynomial of the linear recurrence, and under certain conditions of confluence, the normal representation can be obtained from any representation by a finite automaton which is the composition of two sequential transducers derived from the linear recurrence. The addition of two numbers can be performed by a left sequential transducer.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Beauquier and D. Perrin, Codeterministic automata on infinite words. I.P.L. 20 (1985), 95–98.Google Scholar
  2. [2]
    J. Berstel, Transductions and Context-Free Languages. Teubner, 1979.Google Scholar
  3. [3]
    J. Berstel, Fibonacci words — A survey, in The Book of L, Springer, 1986, 13–27.Google Scholar
  4. [4]
    A. Bertrand-Mathis, Comment écrire les nombres entiers dans une base qui ne l'est pas. To appear.Google Scholar
  5. [5]
    F. Blanchard et G. Hansel, Systèmes codés. T.C.S. 44 (1986), 17–49.Google Scholar
  6. [6]
    S. Eilenberg, Automata, Languages, and Machines, vol. A. Academic Press, 1974.Google Scholar
  7. [7]
    Ch. Frougny, Linear numeration systems of order two. Information and Computation 77 (1988), 233–259.Google Scholar
  8. [8]
    Ch. Frougny, Confluent linear numeration systems. In preparation.Google Scholar
  9. [9]
    G. Huet, Confluent reductions: Abstract properties and applications to term rewriting systems. J. Assoc. Comput. Mach. 27 (1980), 797–821.Google Scholar
  10. [10]
    W. Parry, On the β-expansions of real numbers. Acta Math. Acad. Sci. Hungar. 11 (1960), 401–416.Google Scholar
  11. [11]
    A. Rényi, Representations for real numbers and their ergodic properties. Acta Math. Acad. Sci. Hungar. 8 (1957), 477–493.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Christiane Frougny
    • 1
  1. 1.UER de Mathématiques et InformatiqueLITP and Université René DescartesParisFrance

Personalised recommendations