Counting occurrences for a finite set of words: an inclusion-exclusion approach

MaRDI QIDQ3576752zbMATH OpenFDO

Authors

Publication date 2 August 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0103/0.html

zbMATH Keywords

generating functionsinclusion-exclusionword statistics

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Y99) Analysis of algorithms (68W40)

Recommendations

• Counting occurrences for a finite set of words
• Counting Finite Languages by Total Word Length
• scientific article; zbMATH DE number 1919509
• Clump combinatorics, automata, and word asymptotics
• A word counting graph

Cited in

(4)

• Successions in words and compositions
• Counting occurrences for a finite set of words
• Counting words with Laguerre series
• Asymptotic normality and strong consistency of maximum quasi-likelihood estimates in generalized linear models

Describes a project that uses

Uses Software

• Maple
• Regexpcount

This page was built for publication: Counting occurrences for a finite set of words: an inclusion-exclusion approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576752)