Pages that link to "Item:Q1304818"

The following pages link to Complexity of sequences and dynamical systems (Q1304818):

Displaying 50 items.

• Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
• On minimal Sturmian partial words (Q534335) (← links)
• On possible growths of Toeplitz languages (Q536628) (← links)
• Infinite permutations of lowest maximal pattern complexity (Q544872) (← links)
• The complexity of Fibonacci-like kneading sequences (Q557842) (← links)
• Sequences of linear arithmetical complexity (Q557917) (← links)
• On the fragmentary complexity of symbolic sequences (Q672375) (← 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)
• On the joint subword complexity of automatic sequences (Q837149) (← links)
• Quasiperiodic Sturmian words and morphisms (Q870835) (← links)
• Complexity for extended dynamical systems (Q930558) (← 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)
• Uniform sets and complexity (Q1043538) (← links)
• Complexity for finite factors of infinite sequences (Q1292491) (← links)
• Some characteristics of complex behavior of orbits in dynamical systems (Q1406792) (← links)
• Arithmetical complexity of symmetric D0L words. (Q1426472) (← links)
• An algorithm for the word entropy (Q1659976) (← links)
• Polynomial entropy and expansivity (Q1705822) (← links)
• An extension of the periodicity lemma to longer periods (Q1764895) (← links)
• Palindrome complexity. (Q1853729) (← links)
• Universal \(\beta\)-expansions (Q1882123) (← links)
• The complexity of generalized Sturmian sequences (Q1922164) (← links)
• Subword complexity and power avoidance (Q2326389) (← links)
• The subword complexity of a class of infinite binary words (Q2370831) (← links)
• Substitution dynamical systems on infinite alphabets (Q2372778) (← links)
• On the arithmetical complexity of Sturmian words (Q2373754) (← links)
• Quasiperiodic and Lyndon episturmian words (Q2378539) (← links)
• Dynamic modularity in discrete-time models of regulatory networks (Q2393271) (← links)
• On periodicity and low complexity of infinite permutations (Q2461768) (← links)
• On a class of infinite words with affine factor complexity (Q2465623) (← links)
• Mirror substitutions and palindromic sequences (Q2465631) (← links)
• On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
• Language structure of pattern Sturmian words (Q2502894) (← links)
• Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
• The easily bored sequence (Q2676983) (← links)
• Growth of étale groupoids and simple algebras (Q2799126) (← links)
• Lamination languages (Q2874006) (← links)
• Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion (Q2908171) (← links)
• Three complexity functions (Q2911427) (← links)
• Orbit equivalent substitution dynamical systems and complexity (Q2930626) (← links)
• Sequences With High Nonlinear Complexity (Q2986128) (← links)
• On maximal pattern complexity of some automatic words (Q3093792) (← links)
• Invariant measures for Cantor dynamical systems (Q3296002) (← links)
• On possible growths of arithmetical complexity (Q3421906) (← links)
• Sequences of low arithmetical complexity (Q3423138) (← links)
• Drunken man infinite words complexity (Q3526419) (← links)
• Sequences close to periodic (Q3550936) (← links)
• Constructing Infinite Words of Intermediate Arithmetical Complexity (Q3618624) (← links)