The origins of combinatorics on words

DOI10.1016/J.EJC.2005.07.019zbMATH Open1111.68092OpenAlexW2049646746WikidataQ55951859 ScholiaQ55951859MaRDI QIDQ872058FDOQ872058

Authors: Jean Berstel, Dominique Perrin 

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

Recommendations

• Combinatorics on Words
• scientific article; zbMATH DE number 4108174
• Mini-workshop: Combinatorics on words. Abstracts from the mini-workshop held August 22nd -- August 28th, 2010.
• scientific article; zbMATH DE number 1737190
• Algebraic combinatorics on words. With preface by Jean Berstel and Dominique Perrin.

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Avoidable patterns in strings of symbols
• Subshifts of finite type and sofic systems
• A problem of arrangements
• BLOCKING SETS OF TERMS
• Poincaré recurrence and number theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Introduction to Symbolic Dynamics and Coding
• Differentiable dynamical systems
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automatic Sequences
• Functional Composition Patterns and Power Series Reversion
• Title not available (Why is that?)
• Uniform tag sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On sets of integers containing k elements in arithmetic progression
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A variant of a recursively unsolvable problem
• Title not available (Why is that?)
• A forbidden substructure characterization of Gauss codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Burnside's Problem
• Normal Recurring Decimals
• Free differential calculus. IV: The quotient groups of the lower central series
• Substitutions in dynamics, arithmetics and combinatorics
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniqueness Theorems for Periodic Functions
• Title not available (Why is that?)
• Recursive unsolvability of a problem of Thue
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Gauss Realizability Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Some Sequences of Integers
• Title not available (Why is that?)
• Symbolic Dynamics II. Sturmian Trajectories
• Title not available (Why is that?)
• Title not available (Why is that?)
• A practical method for enumerating cosets of a finite abstract group
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive unsolvability of group theoretic problems
• Concatenation as a basis for arithmetic
• On lacets and their manifolds
• Title not available (Why is that?)
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
• Symbolic Dynamics
• A new proof of the Gauss interlace conjecture
• On a Factorisation of Free Monoids
• Classification of noncounting events
• Note on a Paper By I. J. Good
• Oriented subtrees of an arc digraph
• Treue Darstellung Liescher Ringe.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equations in free semigroups
• On the Number of Generators of a Free Product
• Triality and Lie algebras of type \(D_4\)
• Title not available (Why is that?)
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• Tarski’s problem about the elementary theory of free groups has a positive solution
• Free subalgebras of free associative algebras
• Wie der Beweis der Vermutung von Baudet gefunden wurde
• Exact Markov Probabilities from Oriented Linear Graphs
• On Subsemigroups of Free Semigroups
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Characterization of the Double Point Structure of the Projection of a Polygonal Knot in Regular Position
• Finite combinatory processes—formulation

Cited In (82)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872058)