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

DOI10.1080/10236190500376326zbMATH Open1084.05005OpenAlexW2045445781WikidataQ56794645 ScholiaQ56794645MaRDI QIDQ3369573FDOQ3369573

Authors: 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

Recommendations

• The symbolic Goulden-Jackson cluster method
• Generalizations of the Goulden–Jackson cluster method
• A generalized Goulden-Jackson cluster method and lattice path enumeration
• The Goulden-Jackson cluster method for cyclic words
• The umbral transfer-matrix method. V: The Goulden-Jackson cluster method for infinitely many mistakes

zbMATH Keywords

generating functionfrequency of pattern occurrences

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Generalizations of the Goulden–Jackson cluster method
• The symbolic Goulden-Jackson cluster method
• A generalized Goulden-Jackson cluster method and lattice path enumeration

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

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