Enumeration of words by their number of mistakes

Research output: Contribution to journalArticle

7 Scopus citations

Abstract

Consider all words in {1,...,n}. A fixed set of words is labeled as the set of "mistakes". A generating function for the number of words with m11's,...,mnn's and k mistakes is given. This generalizes a result of Gessel who considered the case where all the mistakes are two-lettered. A similar result has been independently obtained by Goulden and Jackson.

Original languageEnglish (US)
Pages (from-to)89-91
Number of pages3
JournalDiscrete Mathematics
Volume34
Issue number1
DOIs
StatePublished - 1981
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Enumeration of words by their number of mistakes'. Together they form a unique fingerprint.

  • Cite this