Extension of Goulden–Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier–Szpankowski method

DOI10.1080/10236190500376326zbMath1084.05005OpenAlexW2045445781WikidataQ56794645 ScholiaQ56794645MaRDI QIDQ3369573

Yong Kong

Publication date: 2 February 2006

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10236190500376326

zbMATH Keywords

generating functionfrequency of pattern occurrences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Matrix equations and identities (15A24) Combinatorial probability (60C05)

Related Items (2)

A generalized Goulden-Jackson cluster method and lattice path enumeration ⋮ Generalizations of the Goulden–Jackson cluster method

Cites Work

• String overlaps, pattern matching, and nontransitive games
• On Deriving the Inverse of a Sum of Matrices
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• The Goulden—Jackson cluster method: extensions, applications and implementations

This page was built for publication: Extension of Goulden–Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier–Szpankowski method