Enumerative combinatorics on words
From MaRDI portal
This article presents a very interesting survey on several aspects of the use of generating functions in combinatorics on words. The emphasis lies on regular languages. In particular a recent result on the complete characterization of the generating series of regular prefix codes is presented. Another item in special consideration is the so-called necklaces, i.e. words considered up to a cyclic permutation. For the entire collection see [Zbl 0956.00018].
Recommendations
Cited in
(29)- Inventories of unavoidable languages and the word-extension conjecture
- Shirshov's theorem and \(\omega\)-permutability of semigroups
- Well-abstracted transition systems: Application to FIFO automata.
- Three distance theorems and combinatorics on words
- Generalized balances in Sturmian words
- Markov-Dyck shifts, neutral periodic points and topological conjugacy
- Hopping from Chebyshev polynomials to permutation statistics
- Recursive formula of enumeration on forbidden words
- Binomial coefficients and enumeration of restricted words
- Hypergeometric Identities Associated with Statistics on Words
- Words
- Enumeration of Rota-Baxter words
- Counting occurrences for a finite set of words
- Combinatorics, Words and Symbolic Dynamics
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1738654 (Why is no real title available?)
- scientific article; zbMATH DE number 2155195 (Why is no real title available?)
- scientific article; zbMATH DE number 1877262 (Why is no real title available?)
- scientific article; zbMATH DE number 7407638 (Why is no real title available?)
- Languages with membership determined by single letter factors
- Enumeration and generating functions of Rota-Baxter words.
- scientific article; zbMATH DE number 2196238 (Why is no real title available?)
- scientific article; zbMATH DE number 6322907 (Why is no real title available?)
- FINITELY SUBSEQUENTIAL TRANSDUCERS
- On counting of periodic words
- Tiling of toroidal arrays with pictures: uniqueness, shift-equivalence and undecidability
- An optimal pre-determinization algorithm for weighted transducers
- On factorially balanced sets of words
- Combinatorics on partial word correlations
This page was built for publication: Enumerative combinatorics on words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2704225)
