426 research outputs found
Multidimensional extension of the Morse--Hedlund theorem
A celebrated result of Morse and Hedlund, stated in 1938, asserts that a
sequence over a finite alphabet is ultimately periodic if and only if, for
some , the number of different factors of length appearing in is
less than . Attempts to extend this fundamental result, for example, to
higher dimensions, have been considered during the last fifteen years. Let
. A legitimate extension to a multidimensional setting of the notion of
periodicity is to consider sets of \ZZ^d definable by a first order formula
in the Presburger arithmetic . With this latter notion and using a
powerful criterion due to Muchnik, we exhibit a complete extension of the
Morse--Hedlund theorem to an arbitrary dimension $d$ and characterize sets of
$\ZZ^d$ definable in in terms of some functions counting recurrent
blocks, that is, blocks occurring infinitely often
Asymptotic properties of free monoid morphisms
Motivated by applications in the theory of numeration systems and
recognizable sets of integers, this paper deals with morphic words when erasing
morphisms are taken into account. Cobham showed that if an infinite word is the image of a fixed point of a morphism under another
morphism , then there exist a non-erasing morphism and a coding
such that .
Based on the Perron theorem about asymptotic properties of powers of
non-negative matrices, our main contribution is an in-depth study of the growth
type of iterated morphisms when one replaces erasing morphisms with non-erasing
ones. We also explicitly provide an algorithm computing and
from and .Comment: 25 page
Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words
An infinite word is S-automatic if, for all n>=0, its (n + 1)st letter is the
output of a deterministic automaton fed with the representation of n in the
considered numeration system S. In this extended abstract, we consider an
analogous definition in a multidimensional setting and present the connection
to the shape-symmetric infinite words introduced by Arnaud Maes. More
precisely, for d>=2, we state that a multidimensional infinite word x : N^d \to
\Sigma over a finite alphabet \Sigma is S-automatic for some abstract
numeration system S built on a regular language containing the empty word if
and only if x is the image by a coding of a shape-symmetric infinite word
Abstract numeration systems on bounded languages and multiplication by a constant
A set of integers is -recognizable in an abstract numeration system if
the language made up of the representations of its elements is accepted by a
finite automaton. For abstract numeration systems built over bounded languages
with at least three letters, we show that multiplication by an integer
does not preserve -recognizability, meaning that there always
exists a -recognizable set such that is not
-recognizable. The main tool is a bijection between the representation of an
integer over a bounded language and its decomposition as a sum of binomial
coefficients with certain properties, the so-called combinatorial numeration
system
- …