Real numbers having ultimately periodic representations in abstract numeration systems.(English)Zbl 1055.11005

Having previously defined abstract numeration systems associated with infinite ordered regular languages [P. B. A. Lecomte and M. Rigo, Theory Comput. Syst. 34, No. 1, 27–44 (2001; Zbl 0969.68095)] and having extended them for representing real numbers [same authors, Theory Comput. Syst. 35, No. 1, 13–38 (2002; Zbl 0993.68050)], the authors study real numbers whose abstract representation is ultimately periodic. They give syntactic properties of the corresponding words. Furthermore, they show tight links between classical $$\Theta$$-expansions and abstract $$L$$-numerations in the case where $$L$$ is the language of all representations of integers in a linear Bertrand numeration system associated with a Pisot number $$\Theta$$.

MSC:

 11A63 Radix representation; digital problems 68Q45 Formal languages and automata 68R15 Combinatorics on words

Citations:

Zbl 0969.68095; Zbl 0993.68050
Full Text:

References:

 [1] Bertrand, A., Développements en base de Pisot et répartition modulo 1, C. R. acad. sci. Paris, Série A, 285, 419-421, (1977) · Zbl 0362.10040 [2] Bertrand-Mathis, A., Comment écrire LES nombres entiers dans une base qui n’est pas entière, Acta math. acad. sci. hungar., 54, 237-241, (1989) · Zbl 0695.10005 [3] Bruyère, V.; Hansel, G., Bertrand numeration systems and recognizability, Theoret. comput. sci., 181, 17-43, (1997) · Zbl 0957.11015 [4] S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974 · Zbl 0317.94045 [5] Ferenczi, S.; Holton, C.; Zamboni, L.Q., Structure of three interval exchange transformations. I. an arithmetic study, Ann. inst. Fourier (Grenoble), 51, 861-901, (2001) · Zbl 1029.11036 [6] Fraenkel, A.S., Systems of numeration, Am. math. monthly, 92, 105-114, (1985) · Zbl 0568.10005 [7] C. Frougny, B. Solomyak, On representation of integers in linear numeration systems, in: Ergodic theory of Zd actions (Warwick, 1993-1994), 345-368, London Math. Soc. Lecture Note Ser. 228, Cambridge University Press, Cambridge, 1996 [8] Grabner, P.J.; Liardet, P.; Tichy, R.F., Odometers and systems of numeration, Acta arith., 70, 103-123, (1995) · Zbl 0822.11008 [9] Grabner, P.J.; Rigo, M., Additive functions with respect to numeration systems on regular languages, Monatsh. math., 139, 205-219, (2003) · Zbl 1125.11008 [10] Hollander, M., Greedy numeration systems and regularity, Theory comput. syst., 31, 111-133, (1998) · Zbl 0895.68088 [11] Lecomte, P.B.A.; Rigo, M., Numeration systems on a regular language, Theory comput. syst., 34, 27-44, (2001) · Zbl 0969.68095 [12] Lecomte, P.; Rigo, M., On the representation of real number using regular languages, Theory comput. syst., 35, 13-38, (2002) · Zbl 0993.68050 [13] Lopez, L.-M.; Narbel, P., Substitutions and interval exchange transformations of rotation class, Theoret. comput. sci., 255, 323-344, (2001) · Zbl 0974.68160 [14] Lothaire, M., Algebraic combinatorics on words, () · Zbl 1001.68093 [15] Parry, W., On the β-expansions of real numbers, Acta math. acad. sci. hungar., 11, 401-416, (1960) · Zbl 0099.28103 [16] Rényi, A., Representations for real numbers and their ergodic properties, Acta math. acad. sci. hungar., 8, 477-493, (1957) · Zbl 0079.08901 [17] Rigo, M., Numeration systems on a regular language: arithmetic operations, recognizability and formal power series, Theoret. comput. sci., 269, 469-498, (2001) · Zbl 0983.68101 [18] Shallit, J., Numeration systems, linear recurrences, and regular sets, Inf. comput., 113, 331-347, (1994) · Zbl 0810.11006 [19] Schmidt, K., On periodic expansions of Pisot numbers and salem numbers, Bull. London math. soc., 12, 269-278, (1980) · Zbl 0494.10040 [20] Yu, S., Regular languages, (), 41-110
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.