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 the normal view instead:
scientific article; zbMATH DE number 6729913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8042355179786682
0 references
0.8031137585639954
0 references
0.7991498112678528
0 references
0.7845847606658936
0 references
