乐胖代购免代理版

{"id":"https://openalex.org/W3125456877","doi":"https://doi.org/10.3233/fi-2021-2004","title":"Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference","display_name":"Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference","publication_year":2021,"publication_date":"2021-01-15","ids":{"openalex":"https://openalex.org/W3125456877","doi":"https://doi.org/10.3233/fi-2021-2004","mag":"3125456877"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2021-2004","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/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":"funder","lineage":["https://openalex.org/I119004910"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Tomasz Jastrzab","raw_affiliation_strings":["Silesian University of Technology, Gliwice, Poland. Tomasz.Jastrzab@polsl.pl, Zbigniew.Czech@polsl.pl"],"affiliations":[{"raw_affiliation_string":"Silesian University of Technology, Gliwice, Poland. Tomasz.Jastrzab@polsl.pl, Zbigniew.Czech@polsl.pl","institution_ids":["https://openalex.org/I119004910"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014547271","display_name":"Zbigniew J. Czech","orcid":"https://orcid.org/0000-0002-6521-9420"},"institutions":[{"id":"https://openalex.org/I119004910","display_name":"Silesian University of Technology","ror":"https://ror.org/02dyjk442","country_code":"PL","type":"funder","lineage":["https://openalex.org/I119004910"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Zbigniew J. Czech","raw_affiliation_strings":["Silesian University of Technology, Gliwice, Poland. Tomasz.Jastrzab@polsl.pl, Zbigniew.Czech@polsl.pl"],"affiliations":[{"raw_affiliation_string":"Silesian University of Technology, Gliwice, Poland. Tomasz.Jastrzab@polsl.pl, Zbigniew.Czech@polsl.pl","institution_ids":["https://openalex.org/I119004910"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021657351","display_name":"Wojciech Wieczorek","orcid":"https://orcid.org/0000-0003-3191-9151"},"institutions":[{"id":"https://openalex.org/I62088572","display_name":"University of Bielsko-Bia\u0142a","ror":"https://ror.org/01ew38b77","country_code":"PL","type":"funder","lineage":["https://openalex.org/I62088572"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Wojciech Wieczorek","raw_affiliation_strings":["University of Bielsko-Bia\u0142a, Bielsko-Bia\u0142a, Poland. wwieczorek@ath.bielsko.pl"],"affiliations":[{"raw_affiliation_string":"University of Bielsko-Bia\u0142a, Bielsko-Bia\u0142a, Poland. wwieczorek@ath.bielsko.pl","institution_ids":["https://openalex.org/I62088572"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049582497"],"corresponding_institution_ids":["https://openalex.org/I119004910"],"apc_list":null,"apc_paid":null,"fwci":0.665,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.999974,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":82,"max":84},"biblio":{"volume":"178","issue":"3","first_page":"203","last_page":"227"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9992,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9992,"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/T11567","display_name":"semigroups and automata theory","score":0.9934,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9701,"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.82491004},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.52277845},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.50117636},{"id":"https://openalex.org/keywords/grammar-induction","display_name":"Grammar induction","score":0.4705192}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.82491004},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.76122034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.59320295},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.52277845},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.50117636},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.500581},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49300215},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4849377},{"id":"https://openalex.org/C56601403","wikidata":"https://www.wikidata.org/wiki/Q5593673","display_name":"Grammar induction","level":3,"score":0.4705192},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4586551},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.45532963},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44546264},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.43354017},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4334048},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.43172786},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.34999233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32867736},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21745744},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2021-2004","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4205935260","https://openalex.org/W2619559442","https://openalex.org/W2537940722","https://openalex.org/W2525308864","https://openalex.org/W2371400076","https://openalex.org/W2368684504","https://openalex.org/W2269685284","https://openalex.org/W2030569822","https://openalex.org/W1975910189","https://openalex.org/W1825821945"],"abstract_inverted_index":{"The":[0,90,104],"goal":[1],"of":[2,14,24,35,61,92,99,106],"this":[3],"paper":[4],"is":[5,32,55,115],"to":[6,86],"develop":[7],"the":[8,51,59,83,88,97],"parallel":[9,84],"algorithms":[10,85],"that,":[11],"on":[12,96],"input":[13],"a":[15,19,25,33,44,46,76,112],"learning":[16,113],"sample,":[17,45],"identify":[18],"regular":[20,53],"language":[21,54],"by":[22],"means":[23],"nondeterministic":[26],"finite":[27,36],"automaton":[28],"(NFA).":[29],"A":[30],"sample":[31,114],"pair":[34],"sets":[37],"containing":[38],"positive":[39,68],"and":[40,70,80],"negative":[41,73],"examples.":[42],"Given":[43],"minimal":[47],"NFA":[48,109],"that":[49],"represents":[50],"target":[52],"sought.":[56],"We":[57],"define":[58],"task":[60],"finding":[62],"an":[63,108],"NFA,":[64],"which":[65],"accepts":[66],"all":[67,72],"examples":[69],"rejects":[71],"ones,":[74],"as":[75],"constraint":[77],"satisfaction":[78],"problem,":[79],"then":[81],"propose":[82],"solve":[87],"problem.":[89],"results":[91],"comprehensive":[93],"computational":[94],"experiments":[95],"variety":[98],"inference":[100],"tasks":[101],"are":[102],"reported.":[103],"question":[105],"minimizing":[107],"consistent":[110],"with":[111],"computationally":[116],"hard.":[117]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3125456877","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2025-03-21T11:16:39.589434","created_date":"2021-02-01"}