Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching (2014)
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1405.0562
Publication URI: https://arxiv.org/abs/1405.0562
Type: Preprint