iBet uBet
web content aggregator. Adding the entire web to your favor.
Link to original content:
https://api.openalex.org/works/doi:10.4204/EPTCS.96.6
{"id":"https://openalex.org/W1968802713","doi":"https://doi.org/10.4204/eptcs.96.6","title":"Learn with SAT to Minimize B\u00fcchi Automata","display_name":"Learn with SAT to Minimize B\u00fcchi Automata","publication_year":2012,"publication_date":"2012-10-07","ids":{"openalex":"https://openalex.org/W1968802713","doi":"https://doi.org/10.4204/eptcs.96.6","mag":"1968802713"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":null,"pdf_url":"https://arxiv.org/pdf/1210.2452","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://arxiv.org/pdf/1210.2452","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073898616","display_name":"Stephan Barth","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stephan Barth","raw_affiliation_strings":["Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101917108","display_name":"Martin Hofmann","orcid":"https://orcid.org/0000-0002-6258-8255"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Hofmann","raw_affiliation_strings":["Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":0,"currency":"USD","value_usd":0,"provenance":"doaj"},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":1,"citation_normalized_percentile":{"value":0.591326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":65,"max":72},"biblio":{"volume":"96","issue":null,"first_page":"71","last_page":"84"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Active Learning in Machine Learning Research","score":0.9998,"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":"Active Learning in Machine Learning Research","score":0.9998,"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":"Automata Theory and Formal Languages","score":0.9974,"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/T10142","display_name":"Formal Methods in Software Verification and Control","score":0.9843,"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/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.6380518},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.59003496},{"id":"https://openalex.org/keywords/synchronizing-automata","display_name":"Synchronizing Automata","score":0.557602},{"id":"https://openalex.org/keywords/semi-supervised-learning","display_name":"Semi-Supervised Learning","score":0.520889},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.46584094},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.45976323},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.41774508},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.41497225}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.64513844},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.6380518},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.59003496},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.57709765},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.54241},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.510465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4943676},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4851547},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.46584094},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4622701},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.45976323},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.4556726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43396625},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.43078262},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.42451382},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42079854},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.41774508},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4159649},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.41497225},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4067605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36474198},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.34858495},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06989542},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":true,"landing_page_url":null,"pdf_url":"https://arxiv.org/pdf/1210.2452","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":false,"landing_page_url":"https://doaj.org/article/d8839ac926404221b96920309eed98ea","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://api.datacite.org/dois/10.48550/arxiv.1210.2452","pdf_url":null,"source":{"id":"https://openalex.org/S4393179698","display_name":"DataCite API","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210145204","host_organization_name":"DataCite","host_organization_lineage":["https://openalex.org/I4210145204"],"host_organization_lineage_names":["DataCite"],"type":"metadata"},"license":null,"license_id":null,"version":null}],"best_oa_location":{"is_oa":true,"landing_page_url":null,"pdf_url":"https://arxiv.org/pdf/1210.2452","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"display_name":"Quality education","score":0.77,"id":"https://metadata.un.org/sdg/4"}],"grants":[],"datasets":[],"versions":["https://openalex.org/W1968802713","https://openalex.org/W3149698260"],"referenced_works_count":12,"referenced_works":["https://openalex.org/W143291542","https://openalex.org/W1517244811","https://openalex.org/W1562442213","https://openalex.org/W1642494310","https://openalex.org/W1989445634","https://openalex.org/W2116820075","https://openalex.org/W2122493035","https://openalex.org/W2130429059","https://openalex.org/W2154090830","https://openalex.org/W2952908521","https://openalex.org/W4299879353","https://openalex.org/W68069235"],"related_works":["https://openalex.org/W9554130","https://openalex.org/W63685668","https://openalex.org/W3191465415","https://openalex.org/W2810776027","https://openalex.org/W2541245786","https://openalex.org/W2134923509","https://openalex.org/W2042728676","https://openalex.org/W2037872771","https://openalex.org/W1990283467","https://openalex.org/W1482505495"],"abstract_inverted_index":{"We":[0,101,118,165],"describe":[1],"a":[2,29,48,57,86,92,103],"minimization":[3,169],"procedure":[4,69],"for":[5,110,134],"nondeterministic":[6],"B\\\"uchi":[7],"automata":[8,37,126,156,174,187],"(NBA).":[9],"For":[10],"an":[11,83,108],"automaton":[12,15],"A":[13,41],"another":[14],"A_min":[16],"with":[17,25,136,175,188],"the":[18,26,43,65,68,97,168,182],"minimal":[19],"number":[20],"of":[21,28,52,61,67,85,99,113,123,139,154,158,162,184],"states":[22,190],"is":[23,32],"learned":[24],"help":[27],"SAT-solver.":[30],"This":[31],"done":[33],"by":[34],"successively":[35,74],"computing":[36],"A'":[38],"that":[39,45],"approximate":[40],"in":[42,96,131],"sense":[44,98],"they":[46],"accept":[47],"given":[49,58,111],"finite":[50,59],"set":[51,60],"positive":[53,114,143],"examples":[54,161,201],"and":[55,115,157,191,195,198],"reject":[56],"negative":[62,116,145],"examples.":[63,117,146],"In":[64],"course":[66],"these":[70],"example":[71],"sets":[72,112],"are":[73],"increased.":[75],"Thus,":[76],"our":[77],"method":[78,148],"can":[79],"be":[80],"seen":[81],"as":[82],"instance":[84],"generic":[87],"learning":[88],"algorithm":[89],"based":[90],"on":[91,151,170],"\"minimally":[93],"adequate":[94],"teacher\"":[95],"Angluin.":[100],"use":[102,119],"SAT":[104],"solver":[105],"to":[106,127,178],"find":[107],"NBA":[109],"complementation":[120],"via":[121],"construction":[122],"deterministic":[124],"parity":[125],"check":[128],"candidates":[129],"computed":[130],"this":[132],"manner":[133],"equivalence":[135,140],"A.":[137],"Failure":[138],"yields":[141],"new":[142],"or":[144],"Our":[147],"proved":[149],"successful":[150],"complete":[152],"samplings":[153],"small":[155],"quite":[159],"some":[160],"bigger":[163],"automata.":[164],"successfully":[166],"ran":[167],"over":[171,203],"ten":[172,179],"thousand":[173],"mostly":[176],"up":[177],"states,":[180],"including":[181],"complements":[183],"all":[185],"possible":[186],"two":[189],"alphabet":[192],"size":[193],"three":[194],"discuss":[196],"results":[197],"runtimes;":[199],"single":[200],"had":[202],"100":[204],"states.":[205]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1968802713","counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2024-09-17T05:00:17.682408","created_date":"2016-06-24"}
