Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Brunelle, Nathan"'
Linear-time pattern matching engines have seen promising results using Finite Automata (FA) as their computation model. Among different FA variants, deterministic (DFA) and non-deterministic (NFA) are the most commonly used computation models for FA-
Externí odkaz:
http://arxiv.org/abs/2210.10077
Autor:
Wadden, Jack, Brunelle, Nathan, Wang, Ke, El-Hadedy, Mohamed, Robins, Gabriel, Stan, Mircea, Skadron, Kevin
Publikováno v:
2016 IEEE 34th International Conference on Computer Design (ICCD); 2016, p622-629, 8p
Autor:
Wang, Ke, Angstadt, Kevin, Bo, Chunkun, Brunelle, Nathan, Sadredini, Elaheh, Tracy, Tommy, Wadden, Jack, Stan, Mircea, Skadron, Kevin
Publikováno v:
2016 International Conference on Hardware/Software Codesign & System Synthesis (CODES+ISSS); 2016, p1-3, 3p
Publikováno v:
2015 Data Compression Conference; 2015, p441-441, 1p
Publikováno v:
2013 Data Compression Conference; 2013, p478-478, 1p