Pages that link to "Item:Q4781863"

The following pages link to Sequence entropy and the maximal pattern complexity of infinite words (Q4781863):

Displaying 38 items.

• Open problems and conjectures related to the theory of mathematical quasicrystals (Q346735) (← links)
• On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
• On generating binary words palindromically (Q472173) (← links)
• Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
• Cyclic complexity of words (Q507796) (← links)
• Infinite permutations of lowest maximal pattern complexity (Q544872) (← links)
• Examples of entropy generating sequence (Q547386) (← links)
• Sequences of linear arithmetical complexity (Q557917) (← links)
• Periodicity and local complexity (Q596054) (← links)
• Maximal pattern complexity, dual system and pattern recognition (Q714854) (← links)
• Behavior of various complexity functions (Q764361) (← links)
• Maximal pattern complexity of higher dimensional words (Q965228) (← links)
• Combinatorial lemmas and applications to dynamics (Q1011403) (← links)
• Uniform sets and complexity (Q1043538) (← links)
• Super-stationary set, subword problem and the complexity (Q1043967) (← links)
• Arithmetical complexity of symmetric D0L words. (Q1426472) (← links)
• Fractal networks with Sturmian structure (Q2069086) (← links)
• Measure complexity and rigid systems (Q2075428) (← links)
• On the Lie complexity of Sturmian words (Q2089692) (← links)
• Characterization of rotation words generated by homeomorphisms on a circle (Q2341736) (← links)
• On the arithmetical complexity of Sturmian words (Q2373754) (← links)
• Minimal complexity of equidistributed infinite permutations (Q2400969) (← links)
• Open and closed factors in Arnoux-Rauzy words (Q2423399) (← links)
• Mirror substitutions and palindromic sequences (Q2465631) (← links)
• Language structure of pattern Sturmian words (Q2502894) (← links)
• Maximal pattern complexity of two-dimensional words (Q2503281) (← links)
• Maximal pattern complexity of words over \(\ell\) letters (Q2581466) (← links)
• Three complexity functions (Q2911427) (← links)
• On possible growths of arithmetical complexity (Q3421906) (← links)
• Hereditary properties of words (Q4680726) (← links)
• Combinatorics of one-dimensional simple Toeplitz subshifts (Q5110232) (← links)
• Dynamical intricacy and average sample complexity (Q5375959) (← links)
• Substitutions par des motifs en dimension 1 (Q5425749) (← links)
• Abelian combinatorics on words: a survey (Q6101322) (← links)
• Sequence entropy and mean sequence dimension for non-compact metric spaces (Q6150797) (← links)
• Topological entropy and sequence entropy for Hom tree-shifts on unexpandable trees (Q6153429) (← links)
• An analogue of topological sequence entropy for Markov hom tree-shifts (Q6160444) (← links)
• Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)