Palindrome complexity. (Q1853729): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Three distance theorems and combinatorics on words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of factors in a paperfolding sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of infinite sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schrödinger operators with Rudin-Shapiro potentials are not palindromic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors of generalized Rudin-Shapiro sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Rudin-Shapiro sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ring of \(k\)-regular sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on palindromicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5486010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5486009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and special factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform tag sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with minimal block growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local symmetries in the period-doubling sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindrome complexity bounds for primitive substitution sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromes in the Fibonacci word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Episturmian words and some constructions of de Luca and Rauzy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromes and Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subword complexities of various classes of deterministic developmental languages without interactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Les transformations de Chacon : combinatoire, structure géométrique, lien avec les systèmes de complexité $2n+1$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of sequences and dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity for finite factors of infinite sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular continuous spectrum for palindromic Schrödinger operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Episturmian words and episturmian morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4022829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension des courbes planes, papiers plies et suites de Rudin-Shapiro / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of words and recognizability of fixpoints of a substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconnaissabilité des substitutions et complexité des suites automatiques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une nouvelle propriété des suites de Rudin-Shapiro. (A new property of Rudin-Shapiro sequences) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexité des facteurs des mots infinis engendrés par morphismes itérés / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with subword complexity \(2n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709125 / rank
 
Normal rank

Revision as of 10:30, 5 June 2024

scientific article
Language Label Description Also known as
English
Palindrome complexity.
scientific article

    Statements

    Palindrome complexity. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2003
    0 references
    infinite sequences on finite alphabets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers