{"id":"https://openalex.org/W4285697835","doi":"https://doi.org/10.3233/apc200039","title":"On Superlinear Speedups of a Parallel NFA Induction Algorithm","display_name":"On Superlinear Speedups of a Parallel NFA Induction Algorithm","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W4285697835","doi":"https://doi.org/10.3233/apc200039"},"language":"en","primary_location":{"id":"doi:10.3233/apc200039","is_oa":true,"landing_page_url":"https://doi.org/10.3233/apc200039","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/APC200039","source":{"id":"https://openalex.org/S4210175178","display_name":"Advances in parallel computing","issn_l":"0927-5452","issn":["0927-5452","1879-808X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Parallel Computing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/APC200039","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049582497","display_name":"Tomasz Jastrz\u0105b","orcid":"https://orcid.org/0000-0002-7854-9058"},"institutions":[{"id":"https://openalex.org/I119004910","display_name":"Silesian University of Technology","ror":"https://ror.org/02dyjk442","country_code":"PL","type":"education","lineage":["https://openalex.org/I119004910"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Jastrz\u0105b Tomasz","raw_affiliation_strings":["Institute of Informatics, Silesian University of Technology, Gliwice, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Silesian University of Technology, Gliwice, Poland","institution_ids":["https://openalex.org/I119004910"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049582497"],"corresponding_institution_ids":["https://openalex.org/I119004910"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.54493139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9696000218391418,"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":0.9696000218391418,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9650999903678894,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9452000260353088,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8154250383377075},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.6368814706802368},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6267218589782715},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6207639575004578},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5773313045501709},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5696726441383362},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5638337135314941},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4384705424308777},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41978615522384644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.298673152923584},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21287673711776733},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1889553964138031},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.18167373538017273}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8154250383377075},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6368814706802368},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6267218589782715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6207639575004578},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5773313045501709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5696726441383362},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5638337135314941},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4384705424308777},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41978615522384644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.298673152923584},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21287673711776733},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1889553964138031},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.18167373538017273},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/apc200039","is_oa":true,"landing_page_url":"https://doi.org/10.3233/apc200039","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/APC200039","source":{"id":"https://openalex.org/S4210175178","display_name":"Advances in parallel computing","issn_l":"0927-5452","issn":["0927-5452","1879-808X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Parallel Computing","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/apc200039","is_oa":true,"landing_page_url":"https://doi.org/10.3233/apc200039","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/APC200039","source":{"id":"https://openalex.org/S4210175178","display_name":"Advances in parallel computing","issn_l":"0927-5452","issn":["0927-5452","1879-808X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Parallel Computing","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285697835.pdf","grobid_xml":"https://content.openalex.org/works/W4285697835.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W76240386","https://openalex.org/W1491796962","https://openalex.org/W1554957931","https://openalex.org/W1602778142","https://openalex.org/W1604149093","https://openalex.org/W2002089154","https://openalex.org/W2040834199","https://openalex.org/W2095745830","https://openalex.org/W2113676955","https://openalex.org/W2120437191","https://openalex.org/W2124333636","https://openalex.org/W2131211586","https://openalex.org/W2293565514","https://openalex.org/W2394729010","https://openalex.org/W2463255393","https://openalex.org/W2466700122","https://openalex.org/W2791758278","https://openalex.org/W2953981150","https://openalex.org/W4293323242","https://openalex.org/W4302339081","https://openalex.org/W6674540560","https://openalex.org/W6679276510"],"related_works":["https://openalex.org/W1595672793","https://openalex.org/W1945859206","https://openalex.org/W341413838","https://openalex.org/W124607232","https://openalex.org/W2133877380","https://openalex.org/W1996527228","https://openalex.org/W198383578","https://openalex.org/W3089093779","https://openalex.org/W2294025341","https://openalex.org/W2769230307"],"abstract_inverted_index":{"The":[0,20,37,93],"parallel":[1,75],"induction":[2],"algorithm":[3,38,76],"discussed":[4],"in":[5,50,77],"the":[6,17,35,40,53,66,74,86,89,99,103],"paper":[7],"finds":[8],"a":[9,43,63],"minimal":[10],"nondeterministic":[11],"finite":[12],"automaton":[13],"(NFA)":[14],"consistent":[15,64],"with":[16],"given":[18],"sample.":[19],"sample":[21],"consists":[22],"of":[23,45,79,88,105],"examples":[24],"and":[25,32],"counterexamples,":[26],"i.e.,":[27],"words":[28],"that":[29,60],"are":[30],"accepted":[31],"rejected":[33],"by":[34],"automaton.":[36],"transforms":[39],"problem":[41],"to":[42],"family":[44],"constraint":[46],"satisfaction":[47],"problems":[48],"solved":[49],"parallel.":[51],"Only":[52],"first":[54],"solution":[55],"is":[56],"sought,":[57],"which":[58],"means":[59],"upon":[61],"finding":[62],"automaton,":[65],"remaining":[67],"processes":[68],"terminate":[69],"their":[70],"execution.":[71],"We":[72],"analyze":[73],"terms":[78],"achieved":[80],"speedups.":[81,92],"In":[82],"particular,":[83],"we":[84],"discuss":[85],"reasons":[87],"observed":[90],"superlinear":[91],"analysis":[94],"includes":[95],"experiments":[96],"conducted":[97],"for":[98],"samples":[100],"defined":[101],"over":[102],"alphabets":[104],"different":[106],"sizes.":[107]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2022-07-18T00:00:00"}