A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach

DOI10.1007/978-3-642-13509-5_26zbMath1286.68275OpenAlexW1580607811MaRDI QIDQ3575255

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

A Fast Suffix Automata Based Algorithm for Exact Online String Matching ⋮ Bit-Parallel Approximate Matching of Circular Strings with k Mismatches ⋮ Fast and flexible packed string matching ⋮ Compact suffix automata representations for searching long patterns ⋮ Parallel String Matching ⋮ Efficient string matching based on a two-step simulation of the suffix automaton

This page was built for publication: A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach