Maximal pattern complexity for discrete systems

DOI10.1017/S0143385702000585zbMath1014.37003MaRDI QIDQ4781864

Luca Q. Zamboni, Teturo Kamae

Publication date: 14 November 2002

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

zbMATH Keywords

discrete dynamical systemsRauzy substitutionpattern complexitypattern Sturmian wordsrotation on the circleself-similar dynamical system

Mathematics Subject Classification ID

Dynamical systems involving maps of the circle (37E10) Discrete version of topics in analysis (39A12) Topological entropy (37B40) Symbolic dynamics (37B10)

Related Items (29)

Three complexity functions ⋮ Cyclic Complexity of Words ⋮ Open problems and conjectures related to the theory of mathematical quasicrystals ⋮ Minimal complexity of equidistributed infinite permutations ⋮ Combinatorics of one-dimensional simple Toeplitz subshifts ⋮ Sequence entropy and mean sequence dimension for non-compact metric spaces ⋮ Uniform convergence of Schrödinger cocycles over simple Toeplitz subshift ⋮ Sturmian and Episturmian Words ⋮ Dynamical intricacy and average sample complexity ⋮ Uniform convergence of Schrödinger cocycles over bounded Toeplitz subshift ⋮ Cyclic complexity of words ⋮ Maximal pattern complexity of higher dimensional words ⋮ Infinite permutations of lowest maximal pattern complexity ⋮ Substitutions par des motifs en dimension 1 ⋮ Maximal pattern complexity, dual system and pattern recognition ⋮ Language structure of pattern Sturmian words ⋮ Maximal pattern complexity of two-dimensional words ⋮ Combinatorial lemmas and applications to dynamics ⋮ Entropy dimension of topological dynamical systems ⋮ Behavior of various complexity functions ⋮ Fractal networks with Sturmian structure ⋮ Measure complexity and rigid systems ⋮ Uniform sets and complexity ⋮ Super-stationary set, subword problem and the complexity ⋮ On possible growths of arithmetical complexity ⋮ Sequences of low arithmetical complexity ⋮ Characterization of rotation words generated by homeomorphisms on a circle ⋮ Maximal pattern complexity of words over \(\ell\) letters ⋮ On a group theoretic generalization of the Morse-Hedlund theorem

This page was built for publication: Maximal pattern complexity for discrete systems