Maximal pattern complexity for discrete systems
From MaRDI portal
Recommendations
Cited in
(32)- 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
- 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
- On possible growths of arithmetical complexity
- Sequences of low arithmetical complexity
- Open problems and conjectures related to the theory of mathematical quasicrystals
- Sturmian and Episturmian Words
- scientific article; zbMATH DE number 4049111 (Why is no real title available?)
- Uniform convergence of Schrödinger cocycles over bounded Toeplitz subshift
- Cyclic complexity of words
- 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
- Infinite permutations of lowest maximal pattern complexity
- Bound on maximum structural complexity of systems
- Sequence entropy and mean sequence dimension for non-compact metric spaces
- Weighted sequence entropy and maximal pattern entropy
- Complexity of infinite words
- Maximal pattern complexity, dual system and pattern recognition
- On the structure of sequences with minimal maximal pattern complexity
- Behavior of various complexity functions
- Maximal pattern complexity of higher dimensional words
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)
