Corpus ID: 9688762

Fast Regular Expression Matching Based On Dual Glushkov NFA

@inproceedings{Kurai2014FastRE,
  title={Fast Regular Expression Matching Based On Dual Glushkov NFA},
  author={Ryutaro Kurai and N. Yasuda and H. Arimura and S. Nagayama and S. Minato},
  booktitle={Stringology},
  year={2014}
}
  • Ryutaro Kurai, N. Yasuda, +2 authors S. Minato
  • Published in Stringology 2014
  • Computer Science
  • This paper presents a new regular expression matching method by using Dual Glushkov NFA. Dual Glushkov NFA is the variant of Glushkov NFA, and it has the strong property that all the outgoing transitions to a state of it have the same labels. We propose the new matching method Look Ahead Matching that suited to Dual Glushkov NFA structure. This method executes NFA simulation with reading two input symbols at the one time. We use information of next symbol to narrow down the active states on NFA… CONTINUE READING

    References

    SHOWING 1-10 OF 24 REFERENCES
    NR‐grep: a fast and flexible pattern‐matching tool
    • 116
    • PDF
    iNFAnt: NFA pattern matching on GPGPU devices
    • 92
    • PDF
    Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching
    • 20
    • PDF
    An Efficient Hardware Matching Engine for Regular Expression with Nested Kleene Operators
    • 8
    From Regular Expressions to Deterministic Automata
    • 301
    • PDF
    Improving Automata Efficiency by Stretching and Jamming
    • 4
    Stretching and jamming of automata
    • 13
    A taxonomy of finite automata construction algorithms
    • 60
    • PDF
    An Efficient and Scalable Semiconductor Architecture for Parallel Automata Processing
    • 198
    • PDF