Logarithmic density in morphic sequences par
نویسندگان
چکیده
We study the logarithmic frequency of letters and words in morphic sequences and show that this frequency must always exist, answering a question of Allouche and Shallit.
منابع مشابه
Morphic Heights and Periodic Points
An approach to the calculation of local canonical morphic heights is described, motivated by the analogy between the classical height in Diophantine geometry and entropy in algebraic dynamics. We consider cases where the local morphic height is expressed as an integral average of the logarithmic distance to the closure of the periodic points of the underlying morphism. The results may be though...
متن کاملDecidability of Uniform Recurrence of Morphic Sequences
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic sequences are primitive substitutive sequences.
متن کاملA Taxonomy of Morphic Sequences
In this note we classify sequences according to whether they are morphic, pure morphic, uniform morphic, pure uniform morphic, primitive morphic, or pure primitive morphic, and for each possibility we either give an example or prove that no example is possible.
متن کاملOn Uniformly Recurrent Morphic Sequences
In the paper we mainly deal with two well-known types of in nite words: morphic and uniformly recurrent (=almost periodic). We discuss the problem of nding criterion of uniform recurrence for morphic sequences and give e ective polynomial-time such criterion in two particular cases: pure morphic sequences and automatic sequences. We also prove that factor complexity of arbitrary uniformly recur...
متن کاملOn Subword Complexity of Morphic Sequences
We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either Θ(n) for some k ∈ N, or is
متن کامل