Sequence entropy and the maximal pattern complexity of infinite words
From MaRDI portal
Recommendations
Cited in
(59)- Combinatorial lemmas and applications to dynamics
- Uniform sets and complexity
- Super-stationary set, subword problem and the complexity
- Arithmetical complexity of symmetric D0L words.
- Infinite words with linear subword complexity
- Two dimensional word with \(2k\) maximal pattern complexity
- Fractal networks with Sturmian structure
- Measure complexity and rigid systems
- On the Lie complexity of Sturmian words
- Characterization of rotation words generated by homeomorphisms on a circle
- A characterization of eventual periodicity
- On the arithmetical complexity of Sturmian words
- Open and closed factors in Arnoux-Rauzy words
- Mirror substitutions and palindromic sequences
- Language structure of pattern Sturmian words
- Maximal pattern complexity of two-dimensional words
- Maximal pattern complexity of words over \(\ell\) letters
- Three complexity functions
- Words with unbounded periodicity complexity
- On maximal pattern complexity of some automatic words
- Asymptotic subword complexity
- On possible growths of arithmetical complexity
- Open problems and conjectures related to the theory of mathematical quasicrystals
- Complexity of infinite sequences with zero entropy
- On a generalization of abelian equivalence and complexity of infinite words
- Hereditary properties of words
- On generating binary words palindromically
- scientific article; zbMATH DE number 2087492 (Why is no real title available?)
- Maximal pattern complexity for discrete systems
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Cyclic complexity of words
- Combinatorics of one-dimensional simple Toeplitz subshifts
- Complexity and fractal dimensions for infinite sequences with positive entropy
- On a group theoretic generalization of the Morse-Hedlund theorem
- Dynamical intricacy and average sample complexity
- Maximal pattern complexity for Toeplitz words
- Substitutions par des motifs en dimension 1
- Infinite permutations of lowest maximal pattern complexity
- Examples of entropy generating sequence
- Sequences of linear arithmetical complexity
- Periodicity and local complexity
- Abelian combinatorics on words: a survey
- Sequence entropy and mean sequence dimension for non-compact metric spaces
- Topological entropy and sequence entropy for Hom tree-shifts on unexpandable trees
- An analogue of topological sequence entropy for Markov hom tree-shifts
- Characterizations of families of morphisms and words via binomial complexities
- On the complexity functions of Sturmian words
- Opacity complexity of automatic sequences: the general case
- The reflection complexity of sequences over finite alphabets
- On the minimal complexity of infinite words
- Weighted sequence entropy and maximal pattern entropy
- Supremum subsequence entropy for IP-sets
- 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
- On the entropy and letter frequencies of powerfree words
- Maximal pattern complexity of higher dimensional words
- The entropy of square-free words
This page was built for publication: Sequence entropy and the maximal pattern complexity of infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4781863)
