Maximal pattern complexity for discrete systems
From MaRDI portal
Publication:4781864
DOI10.1017/S0143385702000585zbMath1014.37003MaRDI QIDQ4781864
Publication date: 14 November 2002
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
discrete dynamical systems; Rauzy substitution; pattern complexity; pattern Sturmian words; rotation on the circle; self-similar dynamical system
37E10: Dynamical systems involving maps of the circle
39A12: Discrete version of topics in analysis
37B40: Topological entropy
37B10: Symbolic dynamics
Related Items
Combinatorics of one-dimensional simple Toeplitz subshifts, On a group theoretic generalization of the Morse-Hedlund theorem, Dynamical intricacy and average sample complexity, Substitutions par des motifs en dimension 1, Open problems and conjectures related to the theory of mathematical quasicrystals, Uniform convergence of Schrödinger cocycles over bounded Toeplitz subshift, Cyclic complexity of words, Infinite permutations of lowest maximal pattern complexity, Maximal pattern complexity, dual system and pattern recognition, Behavior of various complexity functions, Maximal pattern complexity of higher dimensional words, Combinatorial lemmas and applications to dynamics, Uniform sets and complexity, Super-stationary set, subword problem and the complexity, Fractal networks with Sturmian structure, Measure complexity and rigid systems, Characterization of rotation words generated by homeomorphisms on a circle, Minimal complexity of equidistributed infinite permutations, Uniform convergence of Schrödinger cocycles over simple Toeplitz subshift, Language structure of pattern Sturmian words, Maximal pattern complexity of two-dimensional words, Maximal pattern complexity of words over \(\ell\) letters, Three complexity functions, Cyclic Complexity of Words, Entropy dimension of topological dynamical systems, On possible growths of arithmetical complexity, Sequences of low arithmetical complexity, Sturmian and Episturmian Words
