Pages that link to "Item:Q1326948"

The following pages link to On the complexity of infinite sequences (Q1326948):

Displaying 50 items.

• New second-preimage attacks on hash functions (Q321303) (← links)
• Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
• Relations on words (Q505060) (← links)
• On minimal Sturmian partial words (Q534335) (← links)
• Combinatorial properties of infinite words associated with cut-and-project sequences (Q558162) (← links)
• Complexity and palindromic defect of infinite words (Q620969) (← links)
• Subword complexity of a generalized Thue-Morse word (Q672966) (← links)
• Subword complexity of uniform D0L words over finite groups (Q719314) (← links)
• On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
• Behavior of various complexity functions (Q764361) (← links)
• A two-parameter family of an extension of Beatty sequences (Q941402) (← links)
• Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions (Q952226) (← links)
• On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
• Asymptotic subword complexity of fixed points of group substitutions (Q1019186) (← links)
• On the conjugation of standard morphisms (Q1128481) (← links)
• Combinatorics on patterns of a bidimensional Sturmian sequence (Q1274927) (← links)
• Complexity and special factors (Q1280227) (← links)
• The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity (Q1285569) (← links)
• On the combinatorics of finite words (Q1292479) (← links)
• Complexity for finite factors of infinite sequences (Q1292491) (← links)
• Complexity of generalized Rudin-Shapiro sequences (Q1320516) (← links)
• About the \(p\)-paperfolding words (Q1351443) (← links)
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\). (Q1426035) (← links)
• Generalization of automatic sequences for numeration systems on a regular language (Q1575724) (← links)
• Episturmian words and episturmian morphisms (Q1605314) (← links)
• Words and forbidden factors (Q1605329) (← links)
• On the values for factor complexity (Q1616983) (← links)
• An extension of the periodicity lemma to longer periods (Q1764895) (← links)
• Palindrome complexity. (Q1853729) (← links)
• Palindromes and Sturmian words (Q1960407) (← links)
• The subword complexity of a class of infinite binary words (Q2370831) (← links)
• On the complexity of infinite words generated by countable \(q\)-automata (Q2372782) (← links)
• Mirror substitutions and palindromic sequences (Q2465631) (← links)
• On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
• Quasi-periodic continued fractions (Q2469146) (← links)
• Revision sequences and computers with an infinite amount of time (Q2720396) (← links)
• Complexity functions for two-dimensional sequences (Q2765706) (← links)
• Three complexity functions (Q2911427) (← links)
• Combinatoire de mots récurrents de complexité<i>n+2</i> (Q3512597) (← links)
• Drunken man infinite words complexity (Q3526419) (← links)
• Complexity of infinite sequences with zero entropy (Q3561034) (← links)
• (Q3792243) (← links)
• (Q4530726) (← links)
• Compressibility of Deterministic and Random Infinite Sequences (Q4573286) (← links)
• Reconnaissabilité des substitutions et complexité des suites automatiques (Q4716073) (← links)
• Production en temps réel et complexité de structure de suites infinies (Q4730778) (← links)
• Complexity of infinite words associated with beta-expansions (Q4825393) (← links)
• Two infinite words with cubic subword complexity (Q5132212) (← links)
• Entropy ratio for infinite sequences with positive entropy (Q5214804) (← links)
• Finite State Incompressible Infinite Sequences (Q5410635) (← links)