Pages that link to "Item:Q1152368"
From MaRDI portal
The following pages link to Enumeration of words by their number of mistakes (Q1152368):
Displayed 5 items.
- The \(q\)-exponential generating function for permutations by consecutive patterns and inversions (Q857426) (← links)
- Enumerating totally clean words (Q1109033) (← links)
- Applications of the theory of automata in enumeration (Q1122575) (← links)
- Super ballot numbers (Q1199816) (← links)
- A natural bijection for contiguous pattern avoidance in words (Q6136679) (← links)