Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching (2014)
Attributed to:
Astrophysics Research at Liverpool John Moores University: Newly Appointed Academic Staff
funded by
STFC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1405.0562
Publication URI: http://dx.doi.org/10.48550/arxiv.1405.0562
Type: Journal Article/Review
Parent Publication: arXiv e-prints