Maximal pattern complexity for discrete systems

DOI10.1017/S0143385702000585MaRDI QIDQ4781864zbMATH OpenFDO

Authors Teturo Kamae, Luca Q. Zamboni

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

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

Recommendations

• On maximal pattern complexity of some automatic words
• Maximal pattern complexity of words over \(\ell\) letters
• Maximal pattern complexity of two-dimensional words
• Sequence entropy and the maximal pattern complexity of infinite words
• Maximal pattern complexity for Toeplitz words

Cited in

(29)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4781864)