Login / Signup

A compact representation of nondeterministic (suffix) automata for the bit-parallel approach.

Domenico CantoneSimone FaroEmanuele Giaquinta
Published in: Inf. Comput. (2012)
Keyphrases
  • bit parallel
  • finite state
  • finite automata
  • compact representations
  • pattern matching
  • structured representation
  • data structure
  • suffix tree
  • representation scheme
  • regular expressions
  • databases
  • relational databases