Pages that link to "Item:Q5107065"
From MaRDI portal
The following pages link to Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations (Q5107065):
Displaying 11 items.
- Counting words by number of occurrences of some patterns (Q553997) (← links)
- Staircase patterns in words: subsequences, subwords, and separation number (Q1987094) (← links)
- Fixed points of a random restricted growth sequence (Q2043371) (← links)
- On Stanley-Wilf limit of the pattern 1324 (Q2048379) (← links)
- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations (Q2077272) (← links)
- Counting occurrences for a finite set of words (Q3189073) (← links)
- On avoiding 1233 (Q5045252) (← links)
- Shifting powers in Spivey’s Bell number formula (Q5065552) (← links)
- Applications of the finite state automata for counting restricted permutations and variations (Q5259332) (← links)
- Words over a finite alphabet avoiding 1243 (Q6618737) (← links)
- Consecutive pattern containment and c-Wilf equivalence (Q6665416) (← links)