Anton Cerný

Learn More
The i-th symbol of the well-known infinite word of Thue on the alphabet {0, 1} can be characterized as the parity of the number of occurrences of the digit 1 in the binary representation of i. Generalized words of Thue are based on counting the parity of occurrences of an arbitrary word w ∈ {0, 1} * − 0 * in the binary representation of i. We provide here(More)
a r t i c l e i n f o a b s t r a c t The Parikh matrix mapping is a morphism assigning to each word w over a k-letter alphabet a (k + 1) × (k + 1) upper triangular matrix with entries expressing the number of occurrences in w of some specific subwords. To tackle the problem of ambiguity of this mapping two new mappings have been proposed in literature,(More)