Enumeration of words by their number of mistakes

DOI10.1016/0012-365X(81)90026-1zbMath0461.05005MaRDI QIDQ1152368

Doron Zeilberger

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

number of mistakes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Word problems, etc. in computability and recursion theory (03D40)

Related Items (5)

The \(q\)-exponential generating function for permutations by consecutive patterns and inversions ⋮ Enumerating totally clean words ⋮ Applications of the theory of automata in enumeration ⋮ A natural bijection for contiguous pattern avoidance in words ⋮ Super ballot numbers

Cites Work

• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• Certain Rational Functions Whose Power Series Have Positive Coefficients

This page was built for publication: Enumeration of words by their number of mistakes