50 research outputs found
Marked D0L systems and the 2n-conjecture
AbstractWe show that to test the equivalence of two D0L sequences over an n-letter alphabet generated by marked morphisms it suffices to compare the first 2n+1 initial terms of the sequences. Under an additional condition it is enough to consider the 2n initial terms
Decidability of the HD0L ultimate periodicity problem
In this paper we prove the decidability of the HD0L ultimate periodicity
problem
On a generalization of Abelian equivalence and complexity of infinite words
In this paper we introduce and study a family of complexity functions of
infinite words indexed by k \in \ints ^+ \cup {+\infty}. Let k \in \ints ^+
\cup {+\infty} and be a finite non-empty set. Two finite words and
in are said to be -Abelian equivalent if for all of length
less than or equal to the number of occurrences of in is equal to
the number of occurrences of in This defines a family of equivalence
relations on bridging the gap between the usual notion of
Abelian equivalence (when ) and equality (when We show that
the number of -Abelian equivalence classes of words of length grows
polynomially, although the degree is exponential in Given an infinite word
\omega \in A^\nats, we consider the associated complexity function \mathcal
{P}^{(k)}_\omega :\nats \rightarrow \nats which counts the number of
-Abelian equivalence classes of factors of of length We show
that the complexity function is intimately linked with
periodicity. More precisely we define an auxiliary function q^k: \nats
\rightarrow \nats and show that if for
some k \in \ints ^+ \cup {+\infty} and the is ultimately
periodic. Moreover if is aperiodic, then if and only if is Sturmian. We also
study -Abelian complexity in connection with repetitions in words. Using
Szemer\'edi's theorem, we show that if has bounded -Abelian
complexity, then for every D\subset \nats with positive upper density and for
every positive integer there exists a -Abelian power occurring in
at some position $j\in D.