Counting occurrences for a finite set of words

DOI10.1145/2229163.2229175zbMATH Open1295.05006OpenAlexW2070539158MaRDI QIDQ3189073FDOQ3189073

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

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

Cited In (5)

• Title not available (Why is that?)
• The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
• An application of the Goulden-Jackson cluster theorem
• A generalized Goulden-Jackson cluster method and lattice path enumeration
• On cyclic strings avoiding a pattern

Uses Software

• Maple
• UGJ
• SymUGJ
• SiPerUGJ
• CGJ

Recommendations

• Counting subwords in a partition of a set 👍 👎
• On the combinatorics of finite words 👍 👎
• Counting words by number of occurrences of some patterns 👍 👎
• Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)