Sequence entropy and the maximal pattern complexity of infinite words
From MaRDI portal
Publication:4781863
DOI10.1017/S014338570200055XzbMath1014.37004OpenAlexW2059751203MaRDI QIDQ4781863
Publication date: 14 November 2002
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s014338570200055x
Related Items (38)
On the arithmetical complexity of Sturmian words ⋮ Three complexity functions ⋮ Open problems and conjectures related to the theory of mathematical quasicrystals ⋮ Minimal complexity of equidistributed infinite permutations ⋮ Periodicity and local complexity ⋮ On a generalization of abelian equivalence and complexity of infinite words ⋮ Abelian combinatorics on words: a survey ⋮ Open and closed factors in Arnoux-Rauzy words ⋮ Combinatorics of one-dimensional simple Toeplitz subshifts ⋮ 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 ⋮ Dynamical intricacy and average sample complexity ⋮ Arithmetical complexity of symmetric D0L words. ⋮ On generating binary words palindromically ⋮ Another generalization of abelian equivalence: binomial complexity of infinite words ⋮ Mirror substitutions and palindromic sequences ⋮ Cyclic complexity of words ⋮ Maximal pattern complexity of higher dimensional words ⋮ Infinite permutations of lowest maximal pattern complexity ⋮ Examples of entropy generating sequence ⋮ Substitutions par des motifs en dimension 1 ⋮ Sequences of linear arithmetical complexity ⋮ Maximal pattern complexity, dual system and pattern recognition ⋮ Hereditary properties of words ⋮ Language structure of pattern Sturmian words ⋮ Maximal pattern complexity of two-dimensional words ⋮ Combinatorial lemmas and applications to dynamics ⋮ 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 ⋮ On the Lie complexity of Sturmian words ⋮ Characterization of rotation words generated by homeomorphisms on a circle ⋮ Maximal pattern complexity of words over \(\ell\) letters
This page was built for publication: Sequence entropy and the maximal pattern complexity of infinite words
