Counting occurrences for a finite set of words

DOI10.1145/2229163.2229175zbMath1295.05006OpenAlexW2070539158MaRDI QIDQ3189073

Pierre Nicodème, Julien Clément, Frédérique Bassino

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2229163.2229175

zbMATH Keywords

generating functionsinclusion-exclusionAho-Corasick automatonword statistics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Related Items (3)

A generalized Goulden-Jackson cluster method and lattice path enumeration ⋮ On cyclic strings avoiding a pattern ⋮ An application of the Goulden-Jackson cluster theorem

Uses Software

• Maple
• UGJ
• SymUGJ
• SiPerUGJ
• CGJ

This page was built for publication: Counting occurrences for a finite set of words