AbstractWe consider rotations on the torus T2, and we classify them with respect to the complexity functions. In dimension one, a minimal rotation can be coded by a sturmian word. A sturmian word has complexity n+1 by the Morse–Hedlund theorem. Here we make a generalization in dimension two
AbstractThe aim of this paper is to study local configurations issued from discrete rotations. The a...
We study the palindromic complexity of infinite words obtained by coding rotations on partitions of ...
International audienceFor an extensive range of infinite words, and the associated symbolic dynamica...
AbstractWe consider rotations on the torus T2, and we classify them with respect to the complexity f...
18 pages, 4 figuresInternational audienceWe consider rotations on the torus $\mathbb{T}^2$, and we c...
AbstractWe consider a minimal rotation on the torus Td of direction ω. A natural cellular decomposit...
International audienceWe consider a minimal rotation on the torus T d of direction ω. A natural cell...
AbstractWe study a two-dimensional generalization of Sturmian sequences corresponding to an approxim...
International audienceWe show that the word complexity function p k (n) of a piecewise translation m...
AbstractGiven a rotation of the circle, we study the complexity of formal languages that are generat...
In this paper, we study a class of piecewise rotations on the square. While few theoretical results ...
AbstractUsing the geometric dual technique by Berstel and Pocchiola, we give a uniform O(n3) upper b...
AbstractWe discuss combinatorial properties of a class of binary sequences generalizing Sturmian seq...
AbstractFor an irrational rotation, we use the symbolic dynamics on the sturmian coding to compute e...
AbstractThis paper studies the pattern complexity of n-dimensional words. We show that an n-recurren...
AbstractThe aim of this paper is to study local configurations issued from discrete rotations. The a...
We study the palindromic complexity of infinite words obtained by coding rotations on partitions of ...
International audienceFor an extensive range of infinite words, and the associated symbolic dynamica...
AbstractWe consider rotations on the torus T2, and we classify them with respect to the complexity f...
18 pages, 4 figuresInternational audienceWe consider rotations on the torus $\mathbb{T}^2$, and we c...
AbstractWe consider a minimal rotation on the torus Td of direction ω. A natural cellular decomposit...
International audienceWe consider a minimal rotation on the torus T d of direction ω. A natural cell...
AbstractWe study a two-dimensional generalization of Sturmian sequences corresponding to an approxim...
International audienceWe show that the word complexity function p k (n) of a piecewise translation m...
AbstractGiven a rotation of the circle, we study the complexity of formal languages that are generat...
In this paper, we study a class of piecewise rotations on the square. While few theoretical results ...
AbstractUsing the geometric dual technique by Berstel and Pocchiola, we give a uniform O(n3) upper b...
AbstractWe discuss combinatorial properties of a class of binary sequences generalizing Sturmian seq...
AbstractFor an irrational rotation, we use the symbolic dynamics on the sturmian coding to compute e...
AbstractThis paper studies the pattern complexity of n-dimensional words. We show that an n-recurren...
AbstractThe aim of this paper is to study local configurations issued from discrete rotations. The a...
We study the palindromic complexity of infinite words obtained by coding rotations on partitions of ...
International audienceFor an extensive range of infinite words, and the associated symbolic dynamica...
DOI
Add to ORKG