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

zbMATH Open1192.68942MaRDI QIDQ3576752FDOQ3576752

Author name not available (Why is that?)

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

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

Cited In (3)

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

Uses Software

• Maple
• Regexpcount

   Recommendations

• Counting occurrences for a finite set of words 👍 👎
• Counting Finite Languages by Total Word Length 👍 👎
• Title not available (Why is that?) 👍 👎
• Clump Combinatorics, Automata, and Word Asymptotics 👍 👎
• A word counting graph 👍 👎

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)