{"id":"https://openalex.org/W2757393011","doi":"https://doi.org/10.23638/lmcs-15(3:21)2019","title":"Query learning of derived $\\omega$-tree languages in polynomial time","display_name":"Query learning of derived $\\omega$-tree languages in polynomial time","publication_year":2019,"publication_date":"2019-08-27","ids":{"openalex":"https://openalex.org/W2757393011","doi":"https://doi.org/10.23638/lmcs-15(3:21)2019","mag":"2757393011"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(3:21)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:21)2019","pdf_url":"https://lmcs.episciences.org/5715/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/5715/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022630792","display_name":"Dana Angluin","orcid":"https://orcid.org/0000-0002-6907-2999"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dana Angluin","raw_affiliation_strings":["Yale University"],"affiliations":[{"raw_affiliation_string":"Yale University","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045656414","display_name":"Timos Antonopoulos","orcid":"https://orcid.org/0000-0002-9654-4090"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Timos Antonopoulos","raw_affiliation_strings":["Yale University"],"affiliations":[{"raw_affiliation_string":"Yale University","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003817717","display_name":"Dana Fisman","orcid":"https://orcid.org/0000-0002-6015-4170"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dana Fisman","raw_affiliation_strings":["Ben\u2010Gurion University of the Negev"],"affiliations":[{"raw_affiliation_string":"Ben\u2010Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022630792"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":0.1445,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5470861,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 15, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.996399998664856,"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.9927999973297119,"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/time-complexity","display_name":"Time complexity","score":0.6945673227310181},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.6730114221572876},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.625962495803833},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5805269479751587},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5707012414932251},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5413778424263},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49844813346862793},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49365004897117615},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4844246208667755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4792911410331726},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4540354907512665},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.41983261704444885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38853466510772705},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3119580149650574},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.06734615564346313}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6945673227310181},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6730114221572876},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.625962495803833},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5805269479751587},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5707012414932251},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5413778424263},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49844813346862793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49365004897117615},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4844246208667755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4792911410331726},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4540354907512665},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.41983261704444885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38853466510772705},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3119580149650574},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.06734615564346313},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-15(3:21)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:21)2019","pdf_url":"https://lmcs.episciences.org/5715/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1802.04739","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1802.04739","pdf_url":"https://arxiv.org/pdf/1802.04739","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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1802.04739","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1802.04739","pdf_url":null,"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":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-15(3:21)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:21)2019","pdf_url":"https://lmcs.episciences.org/5715/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5699999928474426}],"awards":[{"id":"https://openalex.org/G4504108201","display_name":null,"funder_award_id":"N00014-17-1","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G4751570384","display_name":null,"funder_award_id":"4-17-1-","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G6721543101","display_name":null,"funder_award_id":"N00014-17-1-2787","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2757393011.pdf","grobid_xml":"https://content.openalex.org/works/W2757393011.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W96074964","https://openalex.org/W325606627","https://openalex.org/W1531123507","https://openalex.org/W1546948343","https://openalex.org/W1594530072","https://openalex.org/W1597210183","https://openalex.org/W1598153029","https://openalex.org/W1757466004","https://openalex.org/W1960291896","https://openalex.org/W1988808695","https://openalex.org/W1989445634","https://openalex.org/W2007981995","https://openalex.org/W2008387578","https://openalex.org/W2044854034","https://openalex.org/W2080001594","https://openalex.org/W2082036629","https://openalex.org/W2088181725","https://openalex.org/W2098039922","https://openalex.org/W2103976262","https://openalex.org/W2129017981","https://openalex.org/W2136248572","https://openalex.org/W2139709458","https://openalex.org/W2145802904","https://openalex.org/W2405152255","https://openalex.org/W2482837440","https://openalex.org/W2535981059","https://openalex.org/W2583228413","https://openalex.org/W2913153438"],"related_works":["https://openalex.org/W2773178955","https://openalex.org/W2989116986","https://openalex.org/W2086025566","https://openalex.org/W1702487489","https://openalex.org/W2132910148","https://openalex.org/W2042051386","https://openalex.org/W270168689","https://openalex.org/W3003471035","https://openalex.org/W2178588595","https://openalex.org/W1523547988"],"abstract_inverted_index":{"We":[0,101],"present":[1],"the":[2,57,79,90,98],"first":[3],"polynomial":[4,37,44,80,114],"time":[5,45,81,115],"algorithm":[6,18,83,142],"to":[7,24,55,143,148],"learn":[8,25,144],"nontrivial":[9],"classes":[10,26],"of":[11,13,27,47,51,60,66,84,92,140],"languages":[12,29,35,54,68,96],"infinite":[14],"trees.":[15],"Specifically,":[16],"our":[17],"uses":[19],"membership":[20],"and":[21,86,130,151],"equivalence":[22],"queries":[23,106,118],"$\\omega$-tree":[28,53],"derived":[30,52],"from":[31],"weak":[32,93],"regular":[33,94,145],"$\\omega$-word":[34,61,67,95,135],"in":[36,113,159],"time.":[38],"The":[39],"method":[40],"is":[41,154],"a":[42,49,71],"general":[43],"reduction":[46],"learning":[48,56,82],"class":[50,59,65,91],"underlying":[58],"languages,":[62],"for":[63,89,123],"any":[64],"recognized":[69],"by":[70],"deterministic":[72,124,131],"B\\"{u}chi":[73,134],"acceptor.":[74],"Our":[75],"reduction,":[76],"combined":[77],"with":[78],"Maler":[85],"Pnueli":[87],"[1995]":[88],"yields":[97],"main":[99],"result.":[100],"also":[102],"show":[103],"that":[104,107,119],"subset":[105,117],"return":[108,120],"counterexamples":[109,122],"can":[110],"be":[111],"implemented":[112],"using":[116],"no":[121],"or":[125,132],"non-deterministic":[126,133],"finite":[127],"word":[128],"acceptors,":[129],"acceptors.":[136],"A":[137],"previous":[138],"claim":[139],"an":[141],"$\\omega$-trees":[146],"due":[147],"Jayasrirani,":[149],"Begam":[150],"Thomas":[152],"[2008]":[153],"unfortunately":[155],"incorrect,":[156],"as":[157],"shown":[158],"Angluin":[160],"[2016].":[161]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}