Stochastic analysis of minimal automata growth for generalized strings
DOI10.1007/S11009-019-09706-8zbMATH Open1434.68240OpenAlexW2922335066WikidataQ128297604 ScholiaQ128297604MaRDI QIDQ2176399FDOQ2176399
Authors: Ian G. Char, Manuel E. Lladser 
Publication date: 4 May 2020
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-019-09706-8
Recommendations
motifminimizationdeterministic finite automatonpolynomial growthgeneralized stringAho-Corasick algorithm
Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Analysis of algorithms (68W40)
Cites Work
- Efficient string matching
- Motif statistics.
- Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
- Distribution Theory of Runs: A Markov Chain Approach
- Title not available (Why is that?)
- Compound Poisson approximation for Markov chains using Stein's method
- Multiple pattern matching: a Markov chain approach
- On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
- Self-alignments in words and their applications
- Introduction to Computational Genomics
- Waiting time distributions of competing patterns in higher-order Markovian sequences
- On pattern frequency occurrences in a Markovian sequence
- Hidden word statistics
- DNA, words and models. Statistics of exceptional words. Translated from the 2003 French original
- Construction of minimal deterministic finite automata from biological motifs
- The distribution of subword counts is usually normal
- Uniqueness of polynomial canonical representations
- Recurrent events in a Markov chain
- Approximation of sojourn-times via maximal couplings: motif frequency distributions
- An efficient linear pseudo-minimization algorithm for Aho-Corasick automata
- Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
- On patterns in sequences of random events
- Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient
- Markovian embeddings of general random strings
Cited In (2)
This page was built for publication: Stochastic analysis of minimal automata growth for generalized strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176399)
