[en] An abstract numeration system is a triple S = (L, Sigma, <) where (Z, <) is a totally ordered alphabet and L a regular language over Z; the associated numeration is defined as follows: by enumerating the words of the regular language L over Z with respect to the induced genealogical ordering, one obtains a one-to-one correspondence between N and L. Furthermore, when the language L is assumed to be exponential, real numbers can also be expanded. The aim of the present paper is to associate with S a self-replicating multiple tiling of athe space, under the following assumption: the adjacency matrix of the trimmed minimal automaton recognizing L is primitive with a dominant eigenvalue being a Pisot unit. This construction generalizes the classical constructions performed for Rauzy fractals associated with Pisot substitutions [16], and for central tiles associated with a Pisot beta-numeration [23].
Disciplines :
Mathematics Computer science
Author, co-author :
Berthé, Valérie
Rigo, Michel ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Abstract numeration systems and tilings
Publication date :
2005
Event name :
30th International Symposium: Mathematical Foundations of Computer Science
Event place :
Gdansk, Poland
Audience :
International
Journal title :
Lecture Notes in Computer Science
ISSN :
0302-9743
eISSN :
1611-3349
Publisher :
Springer-Verlag Berlin, Berlin, Germany
Special issue title :
Mathematical Foundations of Computer Science 2005, Proceedings
Volume :
3618
Pages :
131-143
Peer reviewed :
Peer reviewed
Commentary :
The original publication is available at www.springerlink.com
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
Bibliography
S. Akiyama, Self affine tiling and Pisot numeration system, Number theory and its applications (Kyoto, 1997), Dev. Math. 2 (1999), 7-17, Kluwer Acad. Publ., Dordrecht.
S. Akiyama, On the boundary of self affine tilings generated by Pisot numbers, J. Math. Soc. Japan 54 (2002), 2833-308.
V. Berthé, M. Rigo, Odometers on regular languages, to appear in Theory Comput. Syst.
V. Berthé, A. Siegel, Purely periodic expansions in the non-unit case, preprint 2004.
ǎV. Berthé, A. Siegel, Tilings associated with beta-numeration and substitutions, to appear in Integers: Electronic Journal of Combinatorial Number Theory.
J.-M. Dumont, A. Thomas, Systèmes de numération et fonctions fractales relatifs aux substitutions, Theoret. Comput. Sci. 65 (1989), 153-169.
J.-M. Dumont, A. Thomas, Digital sum moments and substitutions, Acta Arith. 64 (1993), 205-225.
C. Frougny and B. Solomyak, Finite beta-expansions, Ergodic Theory Dynam. Systems 12, (1992), 713-723.
P. J. Grabner, M. Rigo, Additive functions with respect to numeration systems on regular languages, Monatsh. Math. 139 (2003), 205-219.
P.B.A. Lecomte, M. Rigo, Numeration systems on a regular language, Theory Comput. Syst. 34 (2001), 27-44.
P. Lecomte, M. Rigo, On the representation of real numbers using regular languages, Theory Comput. Syst. 35 (2002), 13-38.
P. Lecomte, M. Rigo, Real numbers having ultimately periodic representations in abstract numeration systems, Inform. and Comput. 192 (2004), 57-83.
M. Lothaire, Algebraic Combinatorics on words, Cambridge University Press, Cambridge, (2002).
R.D. Mauldin, S. C. Williams, Hausdorff dimension in graph directed constructions, Trans. Amer. Math. Soc. 309 (1988), 811-829.
N. Pytheas Fogg, Substitutions in Dynamics, Arithmetics and Combinatorics, Lect. Notes in Math. 1794, Springer-Verlag, Berlin, (2002).
G. Rauzy, Nombres algébriques et substitutions, Bull. Soc. Math. France, 110 (1982), 147-178.
M. Rigo, Numeration systems on a regular language: arithmetic operations, recognizability and formal power series, Theoret. Comput. Sci. 269 (2001), 469-498.
M. Rigo, Construction of regular languages and recognizability of polynomials, Discrete Math. 254 (2002), 485-496.
M. Rigo, W. Steiner, Abstract β-expansions and ultimately periodic representations, J. Théor. Nombres Bordeaux 17 (2005), 283-299.
A. Siegel, Représentation des systèmes dynamiques substitutifs non unimodulaires, Ergodic Theory Dynam. Systems 23, (2003), 1247-1273.
V. Sirvent, Y. Wang, Self-affine tiling via substitution dynamical systems and Rauzy fractals, Pacific J. Math. 206 (2002), 465-485.
W. Thomas, Automata on infinite objects, Handbook of theoret. comput. sci., Vol. B, Elsevier, Amsterdam, (1990), 133-191.
W. P. Thurston, Groups, tilings and finite state automata, Lectures notes distributed in conjunction with the Colloquium Series, in AMS Colloquium lectures, (1989).
Similar publications
Sorry the service is unavailable at the moment. Please try again later.
This website uses cookies to improve user experience. Read more
Save & Close
Accept all
Decline all
Show detailsHide details
Cookie declaration
About cookies
Strictly necessary
Performance
Strictly necessary cookies allow core website functionality such as user login and account management. The website cannot be used properly without strictly necessary cookies.
This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.
Performance cookies are used to see how visitors use the website, eg. analytics cookies. Those cookies cannot be used to directly identify a certain visitor.
Used to store the attribution information, the referrer initially used to visit the website
Cookies are small text files that are placed on your computer by websites that you visit. Websites use cookies to help users navigate efficiently and perform certain functions. Cookies that are required for the website to operate properly are allowed to be set without your permission. All other cookies need to be approved before they can be set in the browser.
You can change your consent to cookie usage at any time on our Privacy Policy page.