Sequence entropy and the maximal pattern complexity of infinite words
From MaRDI portal
Publication:4781863
DOI10.1017/S014338570200055XzbMath1014.37004MaRDI 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
Hereditary properties of words, Combinatorics of one-dimensional simple Toeplitz subshifts, Dynamical intricacy and average sample complexity, Substitutions par des motifs en dimension 1, 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, Open problems and conjectures related to the theory of mathematical quasicrystals, On a generalization of abelian equivalence and complexity of infinite words, On generating binary words palindromically, Another generalization of abelian equivalence: binomial complexity of infinite words, Cyclic complexity of words, Infinite permutations of lowest maximal pattern complexity, Examples of entropy generating sequence, Sequences of linear arithmetical complexity, Periodicity and local complexity, Maximal pattern complexity, dual system and pattern recognition, Behavior of various complexity functions, Maximal pattern complexity of higher dimensional words, Combinatorial lemmas and applications to dynamics, Uniform sets and complexity, Super-stationary set, subword problem and the complexity, Arithmetical complexity of symmetric D0L words., 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, On the arithmetical complexity of Sturmian words, Minimal complexity of equidistributed infinite permutations, 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, On possible growths of arithmetical complexity
