Abstract
Let Σ be an alphabet (a finite set). We denote by Σ* the set consisting of all finite words (or strings) that can be made from the letters (or phonemes). The set of all n-letter words over Σ will be denoted by Σn. Let w be an n-letter word in Σn. This paper deals with the cardinality of the sphere SH(w, p):= {u ∈ Σn | H(w, u) = p} of center w and radius p (p ∈ N*) relatively to the Hamming distance H on Σn. A new distance T is defined on the language Σ* and the cardinality of the corresponding sphere ST(w, p):= {u ∈ Σn | T(w, u) = p} is also computed. These cardinalities are showed to satisfy some curious recurrence relations. These recurrence relations incite us to introduce new types of binomial coefficients and binomial formula.
| Original language | English |
|---|---|
| Pages (from-to) | 813-824 |
| Number of pages | 12 |
| Journal | Applied Mathematical Sciences |
| Volume | 3 |
| Issue number | 17-20 |
| State | Published - 2009 |
| Externally published | Yes |
Keywords
- Alphabet
- Binomial coefficient
- Binomial theorem
- Cardinality
- Edit distance
- Hamming distance
- String
ASJC Scopus subject areas
- Applied Mathematics