The Goulden-Jackson cluster method for cyclic words. The powerful Goulden-Jackson cluster method, which generates generating functions enumerating words that avoid, as factors, a prescribed finite set of `mistakes,’ is adapted to handle cyclic words (with marked beginnings).
Keywords for this software
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
- Zhuang, Yan: A generalized Goulden-Jackson cluster method and lattice path enumeration (2018)
- Taylor, Jair: Counting words with Laguerre series (2014)
- Bassino, Frédérique; Clément, Julien; Nicodème, Pierre: Counting occurrences for a finite set of words, combinatorial methods (2012)
- Leopardi, Paul: Testing the tests: using random number generators to improve empirical tests (2009)
- Edlin, Anne E.; Zeilberger, Doron: The Goulden-Jackson cluster method for cyclic words (2000)