Overlap-free words and spectra of matrices (Q837157): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60692281, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounded semigroups of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of repetition-free words -- a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Efficient Approximations of the Joint Spectral Radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the accuracy of the ellipsoid norm approximation of the joint spectral radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of computational complexity results in systems and control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of factors in the Thue-Morse word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overlap-free words and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finiteness property for rational matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for deciding the type of growth of products of integer matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial versus exponential growth in repetition-free binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm to decide whether a binary word contains an overlap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of irreducible binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the joint spectral radius using sum of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized joint spectral radius. A geometric approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behaviour of the partition function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regularity of de Rham curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank

Latest revision as of 23:36, 1 July 2024

scientific article
Language Label Description Also known as
English
Overlap-free words and spectra of matrices
scientific article

    Statements

    Overlap-free words and spectra of matrices (English)
    0 references
    0 references
    0 references
    0 references
    10 September 2009
    0 references
    0 references
    overlap-free words
    0 references
    combinatorics on words
    0 references
    joint spectral radius
    0 references
    joint spectral subradius
    0 references
    Lyapunov exponent
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references