Complexity of sequences and dynamical systems
From MaRDI portal
Recommendations
Cited in
(74)- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Frequency-constrained substring complexity
- Two infinite words with cubic subword complexity
- Combinatorics of past-similarity in higher dimensional transition systems
- On word complexity and topological entropy of random substitution subshifts
- Internal shortest absent word queries in constant time and linear space
- The easily bored sequence
- The subword complexity of a class of infinite binary words
- The complexity of Fibonacci-like kneading sequences
- Three complexity functions
- On possible growths of arithmetical complexity
- An algorithm for the word entropy
- Sequences of low arithmetical complexity
- Complexity and fractal dimensions for infinite sequences with positive entropy
- On maximal pattern complexity of some automatic words
- Sequences of linear arithmetical complexity
- Entropy ratio for infinite sequences with positive entropy
- COMPLEXITY OF CONTINUOUS SEMI-FLOWS AND RELATED DYNAMICAL PROPERTIES
- On a class of infinite words with affine factor complexity
- On the transition semigroups of centrally labeled Rauzy graphs.
- Algorithmic combinatorics on partial words
- Constructing Infinite Words of Intermediate Arithmetical Complexity
- Gaps and approximations in the space of growth functions
- The complexity of generalized Sturmian sequences
- Symbolic dynamics for non-uniformly hyperbolic systems
- Rank and symbolic complexity
- Double sequences of low complexity
- Complexity of sequences with values in a finite set: some examples
- Space–time complexity in Hamiltonian dynamics
- On the complexity of a family of \(k\)-context-free sequences
- SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
- Sequences close to periodic
- Directive words of episturmian words: equivalences and normalization
- Constructing partial words with subword complexities not achievable by full words
- Sequences With High Nonlinear Complexity
- On the structure of generic subshifts
- Language structure of pattern Sturmian words
- Drunken man infinite words complexity
- On complexity functions of infinite words associated with generalized Dyck languages
- An extension of the periodicity lemma to longer periods
- Episturmian words: a survey
- Palindrome complexity.
- Complexity of leading digit sequences
- Quasiperiodic and Lyndon episturmian words
- On periodicity and low complexity of infinite permutations
- On the computational complexity of the Arnold complexity of binary words
- Complexity for finite factors of infinite sequences
- On the joint subword complexity of automatic sequences
- Complexity for extended dynamical systems
- Universal \(\beta\)-expansions
- Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion
- Sequential dynamical systems over words
- Dynamic modularity in discrete-time models of regulatory networks
- Mirror substitutions and palindromic sequences
- Subword complexity of uniform D0L words over finite groups
- Asymptotic subword complexity of fixed points of group substitutions
- Hereditary properties of words
- Polynomial entropy and expansivity
- Invariant measures for Cantor dynamical systems
- Quasiperiodic Sturmian words and morphisms
- Subword complexity and power avoidance
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
- Arithmetical complexity of symmetric D0L words.
- Growth of étale groupoids and simple algebras
- Infinite permutations of lowest maximal pattern complexity
- On the arithmetical complexity of Sturmian words
- On minimal Sturmian partial words
- On possible growths of Toeplitz languages
- Some characteristics of complex behavior of orbits in dynamical systems
- Lamination languages
- On the subword complexity of Thue-Morse polynomial extractions
- Uniform sets and complexity
- Orbit equivalent substitution dynamical systems and complexity
- Substitution dynamical systems on infinite alphabets
This page was built for publication: Complexity of sequences and dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304818)
