论文信息 - Greedy Numeration Systems and Regularity - 字舞流文

Greedy Numeration Systems and Regularity

Abstract. We find necessary and sufficient conditions for the regularity of greedy representations of the natural numbers. The proof relies on the periodicity properties of digit expansions with nonintegral bases.

M. Hollander | M. Hollander

[1] David W. Boyd,et al. Irreducible polynomials with many roots of maximal modulus , 1994 .

[2] Anne Bertrand-Mathis,et al. Comment ecrire les nombres entiers dans une base qui n'est pas entiere , 1989 .

[3] Jacques Sakarovitch. Deux Remarques sur un Théorème de S. Eilenberg , 1983, RAIRO Theor. Informatics Appl..

[4] Jeffrey Shallit,et al. Numeration Systems, Linear Recurrences, and Regular Sets , 1994, Inf. Comput..

[5] Boris Solomyak,et al. Conjugates of Beta-Numbers and the Zero-Free Domain for a Class of Analytic Functions , 1994 .

[6] R. Salem. Algebraic numbers and Fourier analysis , 1963 .

[7] W. Parry. On theβ-expansions of real numbers , 1960 .

[8] Boris Solomyak,et al. Ergodic Theory of ℤ d Actions: On representation of integers in Linear Numeration Systems , 1996 .

[9] François Blanchard. beta-Expansions and Symbolic Dynamics , 1989, Theor. Comput. Sci..

[10] K. Schmidt,et al. On Periodic Expansions of Pisot Numbers and Salem Numbers , 1980 .