scientific article; zbMATH DE number 5604082
From MaRDI portal
Publication:3395963
zbMATH Open1169.68560MaRDI QIDQ3395963FDOQ3395963
Authors: Jean Berstel, Juhani Karhumäki 
Publication date: 15 September 2009
Title of this publication is not available (Why is that?)
Cited In (35)
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- On the maximal sum of exponents of runs in a string
- A robust version of Hegedűs's lemma, with applications
- General framework
- Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products
- The maximal number of cubic runs in a word
- Compressed string-matching in standard Sturmian words
- Growth rates of complexity of power-free languages
- The structure of subword graphs and suffix trees of Fibonacci words
- Asymptotic subword complexity
- Connections between subwords and certain matrix mappings
- On a conjecture about finite fixed points of morphisms
- Extracting powers and periods in a word from its runs structure
- Some Algebraic Properties of Machine Poset of Infinite Words
- Spectral concepts in genome informational analysis
- Reconstructing Words from Right-Bounded-Block Words
- A tight upper bound on the length of maximal bordered box repetition-free words
- Maximum number of distinct and nonequivalent nonstandard squares in a word
- Title not available (Why is that?)
- Thue type problems for graphs, points, and numbers
- On a word avoiding near repeats
- On Dejean's conjecture over large alphabets
- Word-Representable Graphs: a Survey
- Growth rates of power-free languages
- Properties of a class of Toeplitz words
- Periods in extensions of words
- Nonrepetitive colorings of trees
- On the membership of invertible diagonal and scalar matrices
- Growth of power-free languages over large alphabets
- Computing the number of cubic runs in standard Sturmian words
- Fractional parts of powers and Sturmian words
- Reconstructing words from right-bounded-block words
- Relations on words
- On the maximum number of cubic subwords in a word
- On the Maximal Sum of Exponents of Runsin a String
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395963)
