scientific article
From MaRDI portal
Publication:3395963
zbMath1169.68560MaRDI QIDQ3395963
Juhani Karhumäki, Jean Berstel
Publication date: 15 September 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
Reconstructing Words from Right-Bounded-Block Words ⋮ Asymptotic Subword Complexity ⋮ Maximum number of distinct and nonequivalent nonstandard squares in a word ⋮ Word-Representable Graphs: a Survey ⋮ The structure of subword graphs and suffix trees of Fibonacci words ⋮ Nonrepetitive colorings of trees ⋮ On the membership of invertible diagonal and scalar matrices ⋮ Growth of power-free languages over large alphabets ⋮ Extracting powers and periods in a word from its runs structure ⋮ Properties of a class of Toeplitz words ⋮ A tight upper bound on the length of maximal bordered box repetition-free words ⋮ Unnamed Item ⋮ Some Algebraic Properties of Machine Poset of Infinite Words ⋮ General Framework ⋮ On the maximal sum of exponents of runs in a string ⋮ On Dejean's conjecture over large alphabets ⋮ On the Maximal Sum of Exponents of Runsin a String ⋮ Thue type problems for graphs, points, and numbers ⋮ Computing the number of cubic runs in standard Sturmian words ⋮ Relations on words ⋮ Spectral concepts in genome informational analysis ⋮ The maximal number of cubic runs in a word ⋮ On the maximum number of cubic subwords in a word ⋮ Connections between subwords and certain matrix mappings ⋮ Fractional parts of powers and Sturmian words ⋮ On a conjecture about finite fixed points of morphisms ⋮ Compressed string-matching in standard Sturmian words ⋮ Growth rates of complexity of power-free languages ⋮ On a word avoiding near repeats ⋮ Periods in extensions of words ⋮ Two-Sided Bounds for the Growth Rates of Power-Free Languages ⋮ Growth rates of power-free languages ⋮ Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products ⋮ Reconstructing Words from Right-Bounded-Block Words
This page was built for publication:
