{"id":"https://openalex.org/W2074691992","doi":"https://doi.org/10.1080/00207160310001650025","title":"Compact and fast algorithms for safe regular expression search","display_name":"Compact and fast algorithms for safe regular expression search","publication_year":2004,"publication_date":"2004-04-01","ids":{"openalex":"https://openalex.org/W2074691992","doi":"https://doi.org/10.1080/00207160310001650025","mag":"2074691992"},"language":"en","primary_location":{"id":"doi:10.1080/00207160310001650025","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160310001650025","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-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/A5111844760","display_name":"Jean-Marc Champarnaud","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J.-M. Champarnaud","raw_affiliation_strings":["Correspondencejean-marc.champarnaud@univ-rouen.fr"],"affiliations":[{"raw_affiliation_string":"Correspondencejean-marc.champarnaud@univ-rouen.fr","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063887607","display_name":"Fr\u00e9d\u00e9ric Coulon","orcid":"https://orcid.org/0000-0002-4384-3222"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Coulon*","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5081412508","display_name":"Thomas Parantho\u00ebn","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. Parantho\u00ebn","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111844760"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0229,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86494465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"81","issue":"4","first_page":"383","last_page":"401"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/algorithm","display_name":"Algorithm","score":0.685680627822876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6272087693214417},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.574822723865509},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5291348695755005},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5255666971206665},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.5099595785140991},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.49832820892333984},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.4752987325191498},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.4563087522983551},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.42479783296585083},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.41624966263771057},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3453807830810547},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3194822669029236},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15092837810516357},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1451881229877472},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13348105549812317},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10593762993812561}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.685680627822876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6272087693214417},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.574822723865509},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5291348695755005},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5255666971206665},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.5099595785140991},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.49832820892333984},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.4752987325191498},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.4563087522983551},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.42479783296585083},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.41624966263771057},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3453807830810547},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3194822669029236},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15092837810516357},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1451881229877472},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13348105549812317},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10593762993812561},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160310001650025","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160310001650025","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1515839227","https://openalex.org/W1560450186","https://openalex.org/W2045821558","https://openalex.org/W2050710799","https://openalex.org/W2080947572","https://openalex.org/W2081718329","https://openalex.org/W2099540492","https://openalex.org/W2913383557","https://openalex.org/W4210951666","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4249650827","https://openalex.org/W2090734721","https://openalex.org/W2089404966","https://openalex.org/W3094387502","https://openalex.org/W2115419634","https://openalex.org/W3143588635","https://openalex.org/W2089302579","https://openalex.org/W1990473086","https://openalex.org/W3136824659","https://openalex.org/W1644613146"],"abstract_inverted_index":{"This":[0,129],"article":[1],"describes":[2],"an":[3,106],"improvement":[4],"of":[5,14,64,70,89,93,116,146],"the":[6,12,51,67,75,85,90,144],"brute":[7,86],"force":[8,29,87],"determinization":[9,30,88],"algorithm":[10,57,76,98,130],"in":[11,134,143],"case":[13],"homogeneous":[15,72],"nondeterministic":[16],"finite":[17],"automata":[18],"(NFAs),":[19],"as":[20,22],"well":[21],"its":[23,41],"application":[24],"to":[25,50,83],"pattern":[26],"matching.":[27],"Brute":[28],"with":[31],"limited":[32],"memory":[33,110],"may":[34],"provide":[35],"a":[36,46,71,94,113,120,124],"partially":[37],"determinized":[38],"automaton,":[39],"but":[40],"bounded":[42,121],"complexity":[43],"makes":[44],"it":[45,104],"safe":[47],"procedure":[48],"contrary":[49],"classical":[52],"subset":[53,68],"construction.":[54],"Actually,":[55],"our":[56],"is":[58],"inspired":[59],"by":[60,79],"both":[61],"recent":[62],"results":[63,152],"Champarnaud":[65],"concerning":[66],"automaton":[69],"NFA":[73,92],"and":[74,81,149],"recently":[77],"designed":[78],"Navarro":[80],"Raffinot":[82],"implement":[84],"Glushkov":[91],"regular":[95],"pattern.":[96],"Our":[97],"significantly":[99],"improves":[100],"Navarro\u2013Raffinot's":[101],"one":[102],"since":[103],"has":[105,131],"average":[107],"exponentially":[108],"smaller":[109,126],"requirement":[111],"for":[112],"given":[114],"level":[115],"determinization,":[117],"which,":[118],"considering":[119],"memory,":[122],"implies":[123],"quadratically":[125],"parsing":[127],"time.":[128],"been":[132,140],"implemented":[133],"CCP":[135],"software":[136],"(http://www.univ-rouen.fr/LIFAR/aia/ccp.html).":[137],"Tests":[138],"have":[139],"carried":[141],"out":[142],"field":[145],"text":[147],"processing":[148],"biology.":[150],"Experimental":[151],"are":[153],"reported.":[154]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}