A Fast Suffix Automata Based Algorithm for Exact Online String Matching

DOI10.1007/978-3-642-31606-7_13zbMath1297.68279OpenAlexW100582606MaRDI QIDQ2914702

Simone Faro, Thierry Lecroq

Publication date: 20 September 2012

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Related Items (8)

The Range Automaton: an efficient approach to text-searching ⋮ Bit-Parallel Approximate Matching of Circular Strings with k Mismatches ⋮ A weak approach to suffix automata simulation for exact and approximate string matching ⋮ Compact suffix automata representations for searching long patterns ⋮ Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition ⋮ Unnamed Item ⋮ A Very Fast String Matching Algorithm Based on Condensed Alphabets ⋮ Efficient string matching based on a two-step simulation of the suffix automaton

Cites Work

• Unnamed Item
• Fast exact string matching algorithms
• A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
• Fast Pattern Matching in Strings
• String Processing and Information Retrieval

This page was built for publication: A Fast Suffix Automata Based Algorithm for Exact Online String Matching