Complexity and special factors
From MaRDI portal
Publication:1280227
zbMath0921.68065MaRDI QIDQ1280227
Publication date: 14 March 1999
Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119937
automatic sequencesspecial factorssubword complexitycombinatorics on wordscomplexity functionbinary sequenceblock complexitysubstitutive sequences
Related Items
Generalized balances in Sturmian words, Specular sets, Complexity and growth for polygonal billiards, Automata and forbidden words, The subword complexity of a class of infinite binary words, Palindromic complexity of infinite words associated with simple Parry numbers, Recurrence functions of Arnoux-Rauzy sequences, and answer to a question of Morse and Hedlund, Substitution dynamical systems on infinite alphabets, Arithmetics properties of substitutions and infinite automata, Billiard complexity in the hypercube, Specular Sets, A geometrical characterization of factors of multidimensional billiard words and some applications, On the distribution of characteristic parameters of words, Enumeration Formulæ in Neutral Sets, The Gauss map on a class of interval translation mappings, An isolated point in the Heinis spectrum, Complexity of infinite words associated with beta-expansions, Lie complexity of words, Logarithmic equal-letter runs for BWT of purely morphic words, Mixing properties and entropy bounds of a family of Pisot random substitutions, Orbit equivalent substitution dynamical systems and complexity, Minoration of the complexity function associated to a translation on the torus, On the Complexity of the Generalized Fibonacci Words, Languages invariant under more symmetries: overlapping factors versus palindromic richness, Palindromic richness for languages invariant under more symmetries, Topological invariants for words of linear factor complexity, Extremal values of semi‐regular continuants and codings of interval exchange transformations, An upper bound on topological entropy of the Bunimovich stadium billiard map, Measure-theoretically mixing subshifts with low complexity, On factors of synchronized sequences, Derived sequences of complementary symmetric Rote sequences, Rigidity and flexibility of polynomial entropy, Order Conditions for Languages, Non-injectivity of infinite interval exchange transformations and generalized Thue-Morse sequences, Combinatoire de mots récurrents de complexitén+2, Constructing partial words with subword complexities not achievable by full words, On the permutation complexity of the Cantor-like sequences, Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories, Polynomial entropy and expansivity, Bispecial factors in circular non-pushy D0L languages, Drunken man infinite words complexity, On generalized highly potential words, Some improvements of the \(S\)-adic conjecture, On extremal properties of the Fibonacci word, Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm, Classification of rotations on the torus \(\mathbb T^2\), Sturmian jungle (or garden?) on multiliteral alphabets, Another generalization of abelian equivalence: binomial complexity of infinite words, Morphic images of episturmian words having finite palindromic defect, On a class of infinite words with affine factor complexity, On complexity functions of infinite words associated with generalized Dyck languages, Thermodynamic formalism and \(k\)-Bonacci substitutions, On possible growths of Toeplitz languages, The finite index basis property, Generalized Thue-Morse words and palindromic richness, Words and special factors, The complexity of Fibonacci-like kneading sequences, Sequences of linear arithmetical complexity, Languages under substitutions and balanced words, On factorially balanced sets of words, Subword complexity of uniform D0L words over finite groups, Infinite words with finite defect, Spectral properties of Schrödinger operators associated with almost minimal substitution systems, On the D0L Repetition Threshold, Neutral and tree sets of arbitrary characteristic, Polygonal billiards with one sided scattering, A new estimate on complexity of binary generalized pseudostandard words, Maximal bifix decoding, Complexity of Leading Digit Sequences, Palindromic richness, Sequences with constant number of return words, Directional complexity of the hypercubic billiard, A note on symmetries in the Rauzy graph and factor frequencies, On the complexity of a family of \(k\)-context-free sequences, Complexity and fractal dimensions for infinite sequences with positive entropy, Palindromes in infinite ternary words, The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity, Eventually dendric shift spaces, On the infinite permutation generated by the period doubling word, Subword complexity and power avoidance, On the combinatorics of finite words, de Bruijn sequences and de Bruijn graphs for a general language, On possible growths of arithmetical complexity, Sequences of low arithmetical complexity, Forbidden words in symbolic dynamics, Acyclic, connected and tree sets, Palindrome complexity., Semiperiodic words and root-conjugacy., Words and forbidden factors, An estimation of phase transition *
