ACM SIGAPL APL Quote Quad
Properties of words and recognizability of fixed points of a substitution
Theoretical Computer Science
Sums and rational multiples of q-automatic sequences are q-automatic
Theoretical Computer Science
Iteration of maps by an automaton
Discrete Mathematics
Linear cellular automata, finite automata and Pascal's triangle
Discrete Applied Mathematics
On the vector space of the automatic reals
Theoretical Computer Science
Transcendence of formal power series with rational coefficients
Theoretical Computer Science
Characterizing Regular Languages with Polynomial Densities
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés
Proceedings of the 11th Colloquium on Automata, Languages and Programming
If a D0L Language is k-Power Free then it is Circular
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
A Second Course in Formal Languages and Automata Theory
A Second Course in Formal Languages and Automata Theory
Asymptotic subword complexity of fixed points of group substitutions
Theoretical Computer Science
On subword complexity of morphic sequences
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
| Hi-index | 5.23 |
Let the (subword) complexity of a sequence u=(u(n))"n"="0^~ over a finite set @S be the function m@?P"u(m), where P"u(m) denotes the number of distinct blocks u(n)...u(n+m-1) of size m in u. In this paper, we study the complexity of u-(n)=(u"1(n),...,u"r(n))"n"="0^~ when each u"i=(u"i(n))"n"="0^~, i=1,...,r, is a q"i-automatic sequence over a finite set @S"i and q"1,...,q"r=2 are pairwise coprime integers. As an application, we answer a question of Allouche and Shallit regarding morphic real numbers.