On a compact encoding of the swap automaton
From MaRDI portal
Publication:2446600
DOI10.1016/j.ipl.2014.01.004zbMath1284.68350arXiv1307.0099MaRDI QIDQ2446600
Kimmo Fredriksson, Emanuele Giaquinta
Publication date: 17 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.0099
68R05: Combinatorics in computer science
68Q45: Formal languages and automata
68W32: Algorithms on strings
Related Items
Cites Work
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- Overlap matching.
- Pattern Matching with Swaps for Short Patterns in Linear Time
- A New Algorithm for Efficient Pattern Matching with Swaps
- Pattern Matching with Swaps
- A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns
- Fast and flexible string matching by combining bit-parallelism and suffix automata