A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
From MaRDI portal
Publication:3575255
DOI10.1007/978-3-642-13509-5_26zbMATH Open1286.68275OpenAlexW1580607811MaRDI QIDQ3575255FDOQ3575255
Authors: Domenico Cantone, Simone Faro, Emanuele Giaquinta 
Publication date: 26 July 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_26
Recommendations
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- Run-Length Encoded Nondeterministic KMP and Suffix Automata
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
- A New Approach to Determinisation Using Bit-Parallelism
- A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
Cited In (12)
- A fast suffix automata based algorithm for exact online string matching
- Fast and flexible packed string matching
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
- Parallel String Matching
- Efficient string matching based on a two-step simulation of the suffix automaton
- Run-Length Encoded Nondeterministic KMP and Suffix Automata
- A New Approach to Determinisation Using Bit-Parallelism
- A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
- Compact suffix automata representations for searching long patterns
- Succinct representation for (non)deterministic finite automata
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
This page was built for publication: A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575255)
