Skip to main content

Radix representations of algebraic number fields and finite automata

  • Automata and Formal Languages II
  • Conference paper
  • First Online:

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

Abstract

Let L be the set of algebraic integers of a number field Q[-γ]. Let β ⊂ L and let A and D be two finite subsets of L with 0 ∈ D. Assume that β and all its conjugates have moduli greater than one. Denote by v : A* → D* the normalization relation which maps any representation of an algebraic integer in base β with digits in A onto the ones of the same number with digits in D. In this case, the relation v is shown to be computable by a right finite state automaton. If (β, D) is a valid number system, then the normalization v is a right sub-sequential function. We also prove that the question whether (β, D) does or does not give a valid number system for L can be decided by executing a finite number of arithmetical operations.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Berend and Ch. Frougny, Computability by finite automata and Pisot bases. Math. Systems Theory 27 (1994), 274–282.

    Article  MathSciNet  Google Scholar 

  2. J. Berstel, Transductions and context-free languages, Teubner, 1979.

    Google Scholar 

  3. K. Ĉulik II et A. Salomaa, Ambiguity and decision problems concerning number systems. Inform. and Control 56 (1983), 139–153.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Duprat, Y. Herreros and S. Kla, New redundant representations of complex numbers and vectors, IEEE Transactions on Computers, vol. 42, no. 7, Jul. 1993, 817–824.

    Article  MathSciNet  Google Scholar 

  5. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, 1974.

    Google Scholar 

  6. Ch. Frougny, Representation of numbers and finite automata. Math. Systems Theory 25 (1992), 37–60.

    Article  MATH  MathSciNet  Google Scholar 

  7. W.J. Gilbert, Radix representations of quadratic fields. J. Math. Anal. Appl. 83 (1981),264–274.

    Article  MATH  MathSciNet  Google Scholar 

  8. W.J. Gilbert, Arithmetic in complex bases. Math. Mag 57 (1984), 77–81.

    Article  MATH  MathSciNet  Google Scholar 

  9. W.J. Gilbert, The Division algorithm in complex bases. Can. Math. But. 39 (1996), 47–54.

    MATH  Google Scholar 

  10. W.J. Gilbert, Gaussian Integers as Bases for Exotic Number Systems. Unpublished manuscript (1994).

    Google Scholar 

  11. G. Ifrah, Histoire Universelle des Chiffres, tome 2, Robert Laffont, 1994.

    Google Scholar 

  12. S. Körmendi, Canonical number systems in Q[,32-]. Acta Sci. Math. 50 (1986), 351–357.

    MATH  Google Scholar 

  13. I. Kátai and J. Szabó, Canonical number systems for complex integers. Acta Sci. Math. Hung. 37 (1975), 255–260.

    MATH  Google Scholar 

  14. D.E. Knuth, The Art of computer programming, vol. 2: Seminumerical algorithms, 2nd ed., Addison-Wesley, 1988.

    Google Scholar 

  15. S. Lang, Algebra, Addison-Wesley, 1965.

    Google Scholar 

  16. G.W. Leibniz, Mémoires de d'Académie Royale des Sciences, Paris (1703), 110–116.

    Google Scholar 

  17. G. Rauzy, Systèmes de numération. Journées S.M.F. Théorie élémentaire et analytique des nombres, 1982, 137–145.

    Google Scholar 

  18. A. Robert, A good basis for the computing with complex numbers. Elemente der Mathematik 49 (1994), 111–117.

    MATH  Google Scholar 

  19. T. Safer, Représentation des nombres complexes et automates finis, Ph.D dissertation, Université Paris 6, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michel Morvan Christoph Meinel Daniel Krob

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Safer, T. (1998). Radix representations of algebraic number fields and finite automata. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028574

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69705-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics