Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word. (Q5267520)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word. |
scientific article; zbMATH DE number 6729913
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word. |
scientific article; zbMATH DE number 6729913 |
Statements
13 June 2017
0 references
\(k\)-ary word
0 references
pattern
0 references
enumeration
0 references
generating function
0 references
Eulerian polynomial
0 references
Counting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word. (English)
0 references
