Run-Length Encoded Nondeterministic KMP and Suffix Automata

DOI10.1007/978-3-319-22360-5_9zbMath1465.68315arXiv1412.3688OpenAlexW1528416903MaRDI QIDQ2947413

Emanuele Giaquinta

Publication date: 23 September 2015

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

Full work available at URL: https://arxiv.org/abs/1412.3688

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
• Improving practical exact string matching
• Average-optimal string matching
• Faster approximate string matching
• Bit-parallel witnesses and their applications to approximate string matching
• On a compact encoding of the swap automaton
• Efficient pattern matching with scaling
• Fast Pattern Matching in Strings
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• String Processing and Information Retrieval

This page was built for publication: Run-Length Encoded Nondeterministic KMP and Suffix Automata