Complexity of sequences and dynamical systems
From MaRDI portal
Publication:1304818
DOI10.1016/S0012-365X(98)00400-2zbMath0936.37008OpenAlexW2032833010WikidataQ127213106 ScholiaQ127213106MaRDI QIDQ1304818
Publication date: 22 May 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00400-2
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Symbolic dynamics (37B10)
Related Items
Universal \(\beta\)-expansions ⋮ The subword complexity of a class of infinite binary words ⋮ On the joint subword complexity of automatic sequences ⋮ Substitution dynamical systems on infinite alphabets ⋮ On the arithmetical complexity of Sturmian words ⋮ Quasiperiodic and Lyndon episturmian words ⋮ Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion ⋮ Three complexity functions ⋮ Dynamic modularity in discrete-time models of regulatory networks ⋮ An algorithm for the word entropy ⋮ Episturmian words: a survey ⋮ Orbit equivalent substitution dynamical systems and complexity ⋮ Quasiperiodic Sturmian words and morphisms ⋮ Internal shortest absent word queries in constant time and linear space ⋮ The easily bored sequence ⋮ Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ Gaps and approximations in the space of growth functions ⋮ On the structure of generic subshifts ⋮ Some characteristics of complex behavior of orbits in dynamical systems ⋮ Constructing partial words with subword complexities not achievable by full words ⋮ Polynomial entropy and expansivity ⋮ Drunken man infinite words complexity ⋮ Arithmetical complexity of symmetric D0L words. ⋮ ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS ⋮ Invariant measures for Cantor dynamical systems ⋮ On periodicity and low complexity of infinite permutations ⋮ Space–time complexity in Hamiltonian dynamics ⋮ On a class of infinite words with affine factor complexity ⋮ Mirror substitutions and palindromic sequences ⋮ On the subword complexity of Thue-Morse polynomial extractions ⋮ On complexity functions of infinite words associated with generalized Dyck languages ⋮ On minimal Sturmian partial words ⋮ On possible growths of Toeplitz languages ⋮ ALGORITHMIC COMBINATORICS ON PARTIAL WORDS ⋮ An extension of the periodicity lemma to longer periods ⋮ Infinite permutations of lowest maximal pattern complexity ⋮ Double sequences of low complexity ⋮ The complexity of Fibonacci-like kneading sequences ⋮ Sequences of linear arithmetical complexity ⋮ ON THE COMPUTATIONAL COMPLEXITY OF THE ARNOLD COMPLEXITY OF BINARY WORDS ⋮ Hereditary properties of words ⋮ Subword complexity of uniform D0L words over finite groups ⋮ Language structure of pattern Sturmian words ⋮ Growth of étale groupoids and simple algebras ⋮ Complexity of Leading Digit Sequences ⋮ Constructing Infinite Words of Intermediate Arithmetical Complexity ⋮ Directive words of episturmian words: equivalences and normalization ⋮ Entropy ratio for infinite sequences with positive entropy ⋮ Asymptotic subword complexity of fixed points of group substitutions ⋮ On maximal pattern complexity of some automatic words ⋮ SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS ⋮ Unnamed Item ⋮ ON UNIFORMLY RECURRENT MORPHIC SEQUENCES ⋮ On the complexity of a family of \(k\)-context-free sequences ⋮ Complexity and fractal dimensions for infinite sequences with positive entropy ⋮ Subword complexity and power avoidance ⋮ Uniform sets and complexity ⋮ Complexity for finite factors of infinite sequences ⋮ On possible growths of arithmetical complexity ⋮ Sequences of low arithmetical complexity ⋮ Symbolic dynamics for non-uniformly hyperbolic systems ⋮ Palindrome complexity. ⋮ Lamination languages
