Counting occurrences for a finite set of words
From MaRDI portal
Recommendations
- Counting occurrences for a finite set of words: an inclusion-exclusion approach
- Counting words by number of occurrences of some patterns
- scientific article; zbMATH DE number 1577991
- On the combinatorics of finite words
- scientific article; zbMATH DE number 1738654
- scientific article; zbMATH DE number 2150290
- scientific article; zbMATH DE number 2155195
- Counting subwords in a partition of a set
- scientific article; zbMATH DE number 1919509
- Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations
Cited in
(11)- A generalized Goulden-Jackson cluster method and lattice path enumeration
- On cyclic strings avoiding a pattern
- An application of the Goulden-Jackson cluster theorem
- Counting occurrences for a finite set of words: an inclusion-exclusion approach
- Counting words with Laguerre series
- Minimal overlapping embeddings and exact matches in words
- scientific article; zbMATH DE number 6322907 (Why is no real title available?)
- Counting words with Laguerre polynomials
- Counting distinct adjacent r-tuples in words.
- The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
- Asymptotic normality and strong consistency of maximum quasi-likelihood estimates in generalized linear models
This page was built for publication: Counting occurrences for a finite set of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189073)
