{"id":"https://openalex.org/W4413132491","doi":"https://doi.org/10.46298/lmcs-21(3:15)2025","title":"Feasability of Learning Weighted Automata on a Semiring","display_name":"Feasability of Learning Weighted Automata on a Semiring","publication_year":2025,"publication_date":"2025-08-07","ids":{"openalex":"https://openalex.org/W4413132491","doi":"https://doi.org/10.46298/lmcs-21(3:15)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(3:15)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:15)2025","pdf_url":"https://lmcs.episciences.org/16316/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":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16316/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022959189","display_name":"Laure Daviaud","orcid":"https://orcid.org/0000-0002-9220-7118"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Laure Daviaud","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5032620167","display_name":"Marianne Johnson","orcid":"https://orcid.org/0000-0003-4059-845X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marianne Johnson","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022959189"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10037942,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, 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.9995999932289124,"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.9995999932289124,"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.9937999844551086,"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/T12288","display_name":"Optimization and Search Problems","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/semiring","display_name":"Semiring","score":0.8220392465591431},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6685143113136292},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5271422863006592},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5229247808456421},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5225692987442017},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.45005086064338684},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.44959819316864014},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.426902711391449},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4267953634262085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4110293686389923},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40191566944122314},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3752802312374115},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20262816548347473}],"concepts":[{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.8220392465591431},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6685143113136292},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5271422863006592},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5229247808456421},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5225692987442017},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.45005086064338684},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.44959819316864014},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.426902711391449},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4267953634262085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4110293686389923},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40191566944122314},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3752802312374115},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20262816548347473}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/lmcs-21(3:15)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:15)2025","pdf_url":"https://lmcs.episciences.org/16316/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:ueaeprints.uea.ac.uk:99725","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400384","display_name":"UEA Digital Repository (University of East Anglia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1118541","host_organization_name":"University of East Anglia","host_organization_lineage":["https://openalex.org/I1118541"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:doaj.org/article:043c237b4fea443eb2bddad75705f456","is_oa":true,"landing_page_url":"https://doaj.org/article/043c237b4fea443eb2bddad75705f456","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 3 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(3:15)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:15)2025","pdf_url":"https://lmcs.episciences.org/16316/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":[],"awards":[{"id":"https://openalex.org/G2256139321","display_name":"Learning, Approximating and Minimising Streaming Automata for Large-scale Optimisation","funder_award_id":"EP/T018313/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413132491.pdf","grobid_xml":"https://content.openalex.org/works/W4413132491.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2049315791","https://openalex.org/W2087949151","https://openalex.org/W2953483754","https://openalex.org/W2963823488","https://openalex.org/W2058117339","https://openalex.org/W1977193848","https://openalex.org/W1524267824","https://openalex.org/W201862490","https://openalex.org/W2025755860","https://openalex.org/W2133073401"],"abstract_inverted_index":{"Since":[0],"the":[1,7,10,42,62,70,73,104,109,127,173,187,194],"seminal":[2],"work":[3,171],"by":[4,16,89],"Angluin":[5,74],"and":[6,18,92,95,106,136],"introduction":[8],"of":[9,14,29,72,80,100,112,129,179],"L*-algorithm,":[11],"active":[12],"learning":[13],"automata":[15,82,131],"membership":[17,91],"equivalence":[19,93],"queries":[20,94],"has":[21],"been":[22,39],"extensively":[23],"studied":[24],"to":[25,120,126,165,172],"learn":[26],"various":[27],"extensions":[28],"automata.":[30],"For":[31],"weighted":[32],"automata,":[33],"algorithms":[34,56],"for":[35],"restricted":[36],"cases":[37],"have":[38],"developed":[40],"in":[41,61,86],"literature,":[43],"but":[44],"so":[45],"far":[46],"there":[47],"was":[48],"no":[49],"global":[50],"approach":[51],"or":[52],"understanding":[53],"how":[54,121,137],"these":[55],"could":[57],"apply":[58],"(or":[59],"not)":[60],"general":[63],"case.":[64],"In":[65],"this":[66,113],"paper":[67],"we":[68,107],"chart":[69],"boundaries":[71],"approach.":[75,114],"We":[76,115,168],"use":[77],"a":[78,133,153,177],"class":[79],"hypothesis":[81,130,140],"which":[83],"are":[84],"constructed,":[85],"Angluin's":[87],"style,":[88],"using":[90],"solving":[96],"certain":[97],"finite":[98],"systems":[99],"linear":[101],"equations":[102],"over":[103,189],"semiring,":[105],"show":[108],"theoretical":[110],"limitations":[111],"classify":[116],"functions":[117],"with":[118,176],"respect":[119],"guessable":[122],"they":[123],"are,":[124],"corresponding":[125],"existence":[128],"computing":[132],"given":[134],"function,":[135],"such":[138],"an":[139,148,162],"automaton":[141],"can":[142],"be":[143],"found.":[144],"Of":[145],"course,":[146],"from":[147],"algorithmic":[149,184],"standpoint,":[150],"knowing":[151],"that":[152],"solution":[154],"(hypothesis":[155],"automaton)":[156],"exists":[157],"need":[158],"not":[159],"translate":[160],"into":[161],"effective":[163],"algorithm":[164],"find":[166],"one.":[167],"relate":[169],"our":[170],"existing":[174],"literature":[175],"discussion":[178],"some":[180],"known":[181],"properties":[182],"ensuring":[183],"solutions,":[185],"illustrating":[186],"ideas":[188],"several":[190],"familiar":[191],"semirings":[192],"(including":[193],"natural":[195],"numbers).":[196]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}