The origins of combinatorics on words

DOI10.1016/j.ejc.2005.07.019zbMath1111.68092OpenAlexW2049646746WikidataQ55951859 ScholiaQ55951859MaRDI QIDQ872058

Publication date: 27 March 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.07.019

Mathematics Subject Classification ID

Combinatorics on words (68R15) History of mathematics in the 20th century (01A60) History of mathematics in the 18th century (01A50) History of computer science (68-03)

Related Items (78)

Fractional meanings of nonrepetitiveness ⋮ Cyclotomic factors of necklace polynomials ⋮ Additive splitting methods for parallel solutions of evolution problems ⋮ Morphic sequences versus automatic sequences ⋮ No extremal square-free words over large alphabets ⋮ BPS counting for knots and combinatorics on words ⋮ Perfect necklaces ⋮ Lengths of extremal square-free ternary words. ⋮ New algebraic and geometric constructs arising from Fibonacci numbers. ⋮ Word-Representable Graphs: a Survey ⋮ Gray codes for Fibonacci \(q\)-decreasing words ⋮ Piecewise periodicity structure estimates in Shirshov's height theorem. ⋮ Extending de Bruijn sequences to larger alphabets ⋮ Identities and derivative formulas for the combinatorial and Apostol-Euler type numbers by their generating functions ⋮ Subexponential estimates in the height theorem and estimates on numbers of periodic parts of small periods. ⋮ Positive subharmonic solutions to superlinear ODEs with indefinite weight ⋮ On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\) ⋮ On Prouhet's solution to the equal powers problem ⋮ Decidability Problems for Self-induced Systems Generated by a Substitution ⋮ Computing generalized de Bruijn sequences ⋮ Random graph languages ⋮ Asymptotic behavior of some factorizations of random words ⋮ Random iteration for infinite nonexpansive iterated function systems ⋮ On avoding \(r\)-repetitions in \(\mathbb R^2\) ⋮ Analysis of generating functions for special words and numbers and algorithms for computation ⋮ Avoiding 5/4-powers on the alphabet of nonnegative integers ⋮ \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials ⋮ Algebraic properties of Parikh matrices of binary picture arrays ⋮ Embedding subshifts of finite type into the Fibonacci–Dyck shift ⋮ On the number of necklaces whose co-periods divide a given integer ⋮ A tight upper bound on the length of maximal bordered box repetition-free words ⋮ Extensions and reductions of squarefree words ⋮ On extending de Bruijn sequences ⋮ Combinatorial approach of unified Apostol-type polynomials using \(\alpha \)-distanced words ⋮ Completely uniformly distributed sequences based on de Bruijn sequences ⋮ Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches ⋮ Normal Numbers and Computer Science ⋮ Subword balance, position indices and power sums ⋮ Extremal overlap-free and extremal \(\beta\)-free binary words ⋮ Unnamed Item ⋮ Numerical evaluation of special power series including the numbers of Lyndon words: an approach to interpolation functions for Apostol-type numbers and polynomials ⋮ A periodicity theorem for acylindrically hyperbolic groups ⋮ Three research directions in non-uniform cellular automata ⋮ A method for constructing artificial DNA libraries based on generalized de Bruijn sequences ⋮ The coolest way to generate binary strings ⋮ On interpolation functions for the number of \(k\)-ary Lyndon words associated with the Apostol-Euler numbers and their applications ⋮ An improvement of Prouhet’s 1851 result on multigrade chains ⋮ GROUP EXTENSIONS OVER INFINITE WORDS ⋮ Nonrepetitive colorings of line arrangements ⋮ Multiplicity of positive periodic solutions in the superlinear indefinite case via coincidence degree ⋮ Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms ⋮ Generalizations of Parikh mappings ⋮ Gröbner–Shirshov bases and their calculation ⋮ An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words ⋮ Symbol ratio minimax sequences in the lexicographic order ⋮ Unnamed Item ⋮ Grasshopper avoidance of patterns ⋮ Nonrepetitive list colorings of the integers ⋮ Inverse Lyndon words and inverse Lyndon factorizations of words ⋮ Nonrepetitive and pattern-free colorings of the plane ⋮ Music and combinatorics on words: a historical survey ⋮ Avoiding Multiple Repetitions in Euclidean Spaces ⋮ POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS ⋮ Extremal square-free words ⋮ Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning ⋮ N-WAY COMPOSITION OF WEIGHTED FINITE-STATE TRANSDUCERS ⋮ Square-free extensions of words ⋮ Nyldon words ⋮ Tower-type bounds for unavoidable patterns in words ⋮ Applications of Apostol-type numbers and polynomials: approach to techniques of computation algorithms in approximation and interpolation functions ⋮ On Boolean automata isolated cycles and tangential double-cycles dynamics ⋮ Forbidden words in symbolic dynamics ⋮ How to play Thue games ⋮ On a generalization of Thue sequences ⋮ Repetitions in Toeplitz words and the Thue threshold ⋮ ENUMERATING NECKLACES WITH TRANSITIONS ⋮ Identities for Dirichlet and Lambert-type series arising from the numbers of a certain special word ⋮ Computation of k-ary Lyndon words using generating functions and their differential equations

Cites Work

This page was built for publication: The origins of combinatorics on words