The following pages link to (Q4347164):
Displaying 19 items.
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm (Q350914) (← links)
- Sampling different kinds of acyclic automata using Markov chains (Q442144) (← links)
- On-line string matching with feedback (Q673776) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Waiting time and complexity for matching patterns with automata (Q1014407) (← links)
- Separating strings with small automata (Q1116698) (← links)
- Fast pattern matching in indexed texts (Q1566727) (← links)
- Playing with patterns, searching for strings (Q1822928) (← links)
- String matching with simple devices (Q2380036) (← links)
- Automated pattern detection -- an algorithm for constructing optimally synchronizing multi-regular language filters (Q2503304) (← links)
- Distributed pattern matching using finite automata (Q2731277) (← links)
- An Evaluation of Automata Algorithms for String Analysis (Q3075486) (← links)
- String Analysis via Automata Manipulation with Logic Circuit Representation (Q4633540) (← links)
- (Q5061527) (← links)
- Random Generation of Deterministic Acyclic Automata Using Markov Chains (Q5200053) (← links)
- String Processing and Information Retrieval (Q5393959) (← links)
- String Processing and Information Retrieval (Q5393979) (← links)
- Combinatorial Pattern Matching (Q5713538) (← links)