Enumeration of words by their number of mistakes

DOI10.1016/0012-365X(81)90026-1MaRDI QIDQ1152368zbMATH OpenFDO

Authors Doron Zeilberger

Publication date 1981

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(81)90026-1

zbMATH Keywords

number of mistakes

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(5)

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

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

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