Waiting time and complexity for matching patterns with automata
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1045407
- Computing the pattern waiting time: a revisit of the intuitive approach
- Fast string matching in stationary ergodic sources
- An algorithm to compute the character access count distribution for pattern matching algorithms
- Exact analysis of Horspool's and Sunday's pattern matching algorithms with probabilistic arithmetic automata
Cites work
- scientific article; zbMATH DE number 3602484 (Why is no real title available?)
- scientific article; zbMATH DE number 635762 (Why is no real title available?)
- A unified approach to word occurrence probabilities
- Conditionality resolutions
- Explicit Distributional Results In Pattern Formation II
- Explicit distributional results in pattern formation
- Fast Pattern Matching in Strings
- On Simon's string searching algorithm
Cited in
(7)- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Exact analysis of Horspool's and Sunday's pattern matching algorithms with probabilistic arithmetic automata
- String matching algorithms and automata
- Running Time Complexity of Printing an Acyclic Automaton
- On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source
- scientific article; zbMATH DE number 3883604 (Why is no real title available?)
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
This page was built for publication: Waiting time and complexity for matching patterns with automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014407)
