Tilings associated with beta-numeration and substitutions.
For invertible transformations we introduce various notions of topological entropy. For compact invariant sets these notions are all the same and equal the usual topological entropy. We show that for non-invariant sets these notions are different. They can be used to detect the direction in time in which the system evolves to highest complexity.
We consider the languages of finite trees called tree-shift languages which are factorial extensible tree languages. These languages are sets of factors of subshifts of infinite trees. We give effective syntactic characterizations of two classes of regular tree-shift languages: the finite type tree languages and the tree languages which are almost of finite type. Each class corresponds to a class of subshifts of trees which is invariant by conjugacy. For this goal, we define a tree algebra which...
Un mot sturmien est la discrétisation d’une droite de pente irrationnelle. Un nombre de Sturm est la pente d’un mot sturmien qui est invariant par une substitution non triviale. Ces nombres sont certains irrationnels quadratiques caractérisés par la forme de leur développement en fraction continue. Nous donnons une caractérisation très simple des nombres de Sturm : un nombre irrationnel positif est de Sturm (de première espèce) si et seulement s’il est quadratique et à conjugué négatif.
We investigate the structure of kneading sequences that belong to unimodal maps for which the omega-limit set of the turning point is a minimal Cantor set. We define a scheme that can be used to generate uniformly recurrent and regularly recurrent infinite sequences over a finite alphabet. It is then shown that if the kneading sequence of a unimodal map can be generated from one of these schemes, then the omega-limit set of the turning point must be a minimal Cantor set.
Let be a unimodular Pisot substitution over a letter alphabet and let be the associated Rauzy fractals. In the present paper we want to investigate the boundaries () of these fractals. To this matter we define a certain graph, the so-called contact graph of . If satisfies a combinatorial condition called the super coincidence condition the contact graph can be used to set up a self-affine graph directed system whose attractors are certain pieces of the boundaries . From this graph...
We prove that by considering a finitary (almost continuous) symbolic extension of a topological dynamical system instead of a continuous extension, one cannot achieve any drop of the entropy of the extension.
We define by simple conditions two wide subclasses of the so-called Arnoux-Rauzy systems; the elements of the first one share the property of (measure-theoretic) weak mixing, thus we generalize and improve a counter-example to the conjecture that these systems are codings of rotations; those of the second one have eigenvalues, which was known hitherto only for a very small set of examples.