{"id":"https://openalex.org/W2022899369","doi":"https://doi.org/10.1109/fpt.2013.6718381","title":"NFA reduction for regular expressions matching using FPGA","display_name":"NFA reduction for regular expressions matching using FPGA","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2022899369","doi":"https://doi.org/10.1109/fpt.2013.6718381","mag":"2022899369"},"language":"en","primary_location":{"id":"doi:10.1109/fpt.2013.6718381","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2013.6718381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Field-Programmable Technology (FPT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023338990","display_name":"Vlastimil Ko\u0161a\u0159","orcid":"https://orcid.org/0000-0002-8851-1520"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vlastimil Kosar","raw_affiliation_strings":["Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic","Fac. of Inf. Technol., Brno Univ. of Technol., Brno, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]},{"raw_affiliation_string":"Fac. of Inf. Technol., Brno Univ. of Technol., Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005548272","display_name":"Martin \u017d\u00e1dn\u00edk","orcid":"https://orcid.org/0000-0002-2099-2348"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Martin Zadnik","raw_affiliation_strings":["Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic","Fac. of Inf. Technol., Brno Univ. of Technol., Brno, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]},{"raw_affiliation_string":"Fac. of Inf. Technol., Brno Univ. of Technol., Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021958683","display_name":"Jan Ko\u0159enek","orcid":"https://orcid.org/0000-0002-4662-7349"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Korenek","raw_affiliation_strings":["Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic","Fac. of Inf. Technol., Brno Univ. of Technol., Brno, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]},{"raw_affiliation_string":"Fac. of Inf. Technol., Brno Univ. of Technol., Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I60587646"],"apc_list":null,"apc_paid":null,"fwci":2.2209,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87592561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"510","issue":null,"first_page":"338","last_page":"341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.8314803242683411},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.8217540979385376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7975319623947144},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.7564773559570312},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.6673179268836975},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6568876504898071},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5892455577850342},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5788522958755493},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5574823021888733},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5210539698600769},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5107464790344238},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.42350342869758606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4174301028251648},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29070115089416504},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.22585701942443848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.124606192111969},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.09412339329719543}],"concepts":[{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.8314803242683411},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.8217540979385376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7975319623947144},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.7564773559570312},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.6673179268836975},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6568876504898071},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5892455577850342},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5788522958755493},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5574823021888733},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5210539698600769},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5107464790344238},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42350342869758606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4174301028251648},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29070115089416504},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.22585701942443848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.124606192111969},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.09412339329719543},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fpt.2013.6718381","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fpt.2013.6718381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Field-Programmable Technology (FPT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1505262931","https://openalex.org/W1512254831","https://openalex.org/W1541666628","https://openalex.org/W1543732613","https://openalex.org/W1655192411","https://openalex.org/W1707172707","https://openalex.org/W1960511147","https://openalex.org/W2048411372","https://openalex.org/W2068470792","https://openalex.org/W2073709434","https://openalex.org/W2079329309","https://openalex.org/W2097960294","https://openalex.org/W2102066200","https://openalex.org/W2117952194","https://openalex.org/W2122493035","https://openalex.org/W2122820686","https://openalex.org/W2139418336","https://openalex.org/W2170523504","https://openalex.org/W2516729988","https://openalex.org/W2626796407","https://openalex.org/W2911452205","https://openalex.org/W4212834144","https://openalex.org/W6632721105","https://openalex.org/W6637452973","https://openalex.org/W6730601688","https://openalex.org/W6757822937"],"related_works":["https://openalex.org/W4249650827","https://openalex.org/W2090734721","https://openalex.org/W2089404966","https://openalex.org/W2790652601","https://openalex.org/W3094387502","https://openalex.org/W2115419634","https://openalex.org/W2770489137","https://openalex.org/W2538831380","https://openalex.org/W3143588635","https://openalex.org/W2146605784"],"abstract_inverted_index":{"Many":[0],"algorithms":[1,25,115],"have":[2],"been":[3],"proposed":[4],"to":[5,32,69,80],"accelerate":[6],"regular":[7,49,104],"expression":[8],"matching":[9],"via":[10],"mapping":[11,82],"of":[12,29,48,61,73,124],"a":[13,18,43,66,94,127,132],"nondeterministic":[14],"finite":[15],"automaton":[16],"into":[17,83,136],"circuit":[19],"implemented":[20],"in":[21,77,121,141],"an":[22],"FPGA.":[23,84,143],"These":[24],"exploit":[26],"unique":[27],"features":[28],"the":[30,37,40,46,71,122,142],"FPGA":[31,41],"achieve":[33,116],"high":[34],"throughput.":[35],"On":[36],"other":[38],"hand":[39],"poses":[42],"limit":[44],"on":[45],"number":[47,72,123],"expressions":[50,105],"by":[51],"its":[52,81],"limited":[53],"resources.":[54],"In":[55],"this":[56],"paper,":[57],"we":[58],"investigate":[59],"applicability":[60],"NFA":[62,78,89,113],"reduction":[63,90,96,114,120,133],"techniques":[64],"-":[65],"formal":[67],"aparatus":[68],"reduce":[70],"states":[74,125],"and":[75,98,108],"transitions":[76],"prior":[79],"The":[85,101,111],"paper":[86],"presents":[87],"several":[88],"techniques,":[91],"each":[92],"with":[93],"different":[95],"power":[97],"time":[99],"complexity.":[100],"evaluation":[102],"utilizes":[103],"from":[106],"Snort":[107,128],"L7":[109],"decoder.":[110],"best":[112],"more":[117],"than":[118],"66%":[119,137],"for":[126],"ftp":[129],"module.":[130],"Such":[131],"translates":[134],"directly":[135],"LUT-FF":[138],"pairs":[139],"saving":[140]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}