{"id":"https://openalex.org/W4210409569","doi":"https://doi.org/10.46298/lmcs-18(1:29)2022","title":"Residuality and Learning for Nondeterministic Nominal Automata","display_name":"Residuality and Learning for Nondeterministic Nominal Automata","publication_year":2022,"publication_date":"2022-02-03","ids":{"openalex":"https://openalex.org/W4210409569","doi":"https://doi.org/10.46298/lmcs-18(1:29)2022"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-18(1:29)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:29)2022","pdf_url":"https://lmcs.episciences.org/9038/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":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/9038/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058957702","display_name":"Joshua Moerman","orcid":"https://orcid.org/0000-0001-9819-8374"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Joshua Moerman","raw_affiliation_strings":["RTWH Aachen University, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9819-8374","affiliations":[{"raw_affiliation_string":"RTWH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021533181","display_name":"Matteo Sammartino","orcid":"https://orcid.org/0000-0003-1456-2242"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matteo Sammartino","raw_affiliation_strings":["Royal Holloway University of London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Holloway University of London, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.01050289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"Volume 18, Issue 1","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/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6369414329528809},{"id":"https://openalex.org/keywords/learnability","display_name":"Learnability","score":0.6324100494384766},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.609112560749054},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.5283157229423523},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4985980987548828},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4962831139564514},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4717867076396942},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.45671525597572327},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4532131552696228},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4516807794570923},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.44348767399787903},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.41528230905532837},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40991151332855225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3359314203262329},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24304768443107605},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.1920316219329834}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6369414329528809},{"id":"https://openalex.org/C2777723229","wikidata":"https://www.wikidata.org/wiki/Q4367921","display_name":"Learnability","level":2,"score":0.6324100494384766},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.609112560749054},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.5283157229423523},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4985980987548828},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4962831139564514},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4717867076396942},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.45671525597572327},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4532131552696228},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4516807794570923},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.44348767399787903},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.41528230905532837},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40991151332855225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3359314203262329},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24304768443107605},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.1920316219329834},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.46298/lmcs-18(1:29)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:29)2022","pdf_url":"https://lmcs.episciences.org/9038/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:1910.11666","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.11666","pdf_url":"https://arxiv.org/pdf/1910.11666","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":"pmh:oai:doaj.org/article:26436fac7a904640a23c43b29551924e","is_oa":true,"landing_page_url":"https://doaj.org/article/26436fac7a904640a23c43b29551924e","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":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)","raw_type":"article"},{"id":"pmh:oai:research.ou.nl:publications/b1b6eff4-2e91-4606-a54d-486baa0fdb95","is_oa":true,"landing_page_url":"https://hdl.handle.net/1820/b1b6eff4-2e91-4606-a54d-486baa0fdb95","pdf_url":null,"source":{"id":"https://openalex.org/S4406922485","display_name":"Open University of the Netherlands Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Moerman, J & Sammartino, M 2022, 'Residuality and Learning for Nondeterministic Nominal Automata', Logical Methods in Computer Science, vol. 18, no. 1, 29. https://doi.org/10.46298/lmcs-18(1:29)2022","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:ou:oai:research.ou.nl:publications/b1b6eff4-2e91-4606-a54d-486baa0fdb95","is_oa":true,"landing_page_url":"https://research.ou.nl/en/publications/b1b6eff4-2e91-4606-a54d-486baa0fdb95","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"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, 18(1):29. Logical Methods in Computer Science e.V.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-18(1:29)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:29)2022","pdf_url":"https://lmcs.episciences.org/9038/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":[{"score":0.7400000095367432,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[{"id":"https://openalex.org/G7721971682","display_name":"Verification of Hardware Concurrency via Model Learning (CLeVer)","funder_award_id":"EP/S028641/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G789605047","display_name":null,"funder_award_id":"EP/S028641/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8979331786","display_name":null,"funder_award_id":"787914","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4210409569.pdf","grobid_xml":"https://content.openalex.org/works/W4210409569.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W189278745","https://openalex.org/W427601738","https://openalex.org/W1108093586","https://openalex.org/W1513180883","https://openalex.org/W1520252399","https://openalex.org/W1552686964","https://openalex.org/W1561117500","https://openalex.org/W1598138910","https://openalex.org/W1793241515","https://openalex.org/W1795569145","https://openalex.org/W1974713491","https://openalex.org/W1989445634","https://openalex.org/W1992050455","https://openalex.org/W2056665285","https://openalex.org/W2057427285","https://openalex.org/W2070934866","https://openalex.org/W2081396910","https://openalex.org/W2093397547","https://openalex.org/W2130826964","https://openalex.org/W2294377302","https://openalex.org/W2295721640","https://openalex.org/W2295804767","https://openalex.org/W2320709386","https://openalex.org/W2604674584","https://openalex.org/W2798653279","https://openalex.org/W2889973542","https://openalex.org/W2954757119","https://openalex.org/W2964023069","https://openalex.org/W2977245035","https://openalex.org/W2981526392","https://openalex.org/W2983079851","https://openalex.org/W3029697665","https://openalex.org/W3099482826","https://openalex.org/W3099647739","https://openalex.org/W3103813054","https://openalex.org/W3127643424","https://openalex.org/W3138415507","https://openalex.org/W3151786004","https://openalex.org/W4244661353","https://openalex.org/W4251967880","https://openalex.org/W4287239951","https://openalex.org/W4288029515","https://openalex.org/W4299414265"],"related_works":["https://openalex.org/W2537940722","https://openalex.org/W4205935260","https://openalex.org/W3143588635","https://openalex.org/W2037872771","https://openalex.org/W2462239665","https://openalex.org/W3153637812","https://openalex.org/W1987608226","https://openalex.org/W2124370744","https://openalex.org/W4231358735","https://openalex.org/W2171527505"],"abstract_inverted_index":{"We":[0,53],"are":[1],"motivated":[2],"by":[3,23,33],"the":[4,24,41,82,124],"following":[5],"question:":[6],"which":[7,61,112],"data":[8],"languages":[9,31,128],"admit":[10],"an":[11],"active":[12,75],"learning":[13,76],"algorithm?":[14],"This":[15,72],"question":[16],"was":[17],"left":[18],"open":[19],"in":[20,117,123],"previous":[21],"work":[22],"authors,":[25],"and":[26,78],"is":[27,91,102,129],"particularly":[28],"challenging":[29],"for":[30,81,93,98,111],"recognised":[32],"nondeterministic":[34,50],"automata.":[35,52,95],"To":[36],"answer":[37],"it,":[38],"we":[39,113],"develop":[40,114],"theory":[42],"of":[43,49,70,108,126,136,138,143],"residual":[44,100,109],"nominal":[45,51,94,118,127],"automata,":[46],"a":[47,67,87,105,130,133],"subclass":[48],"prove":[54],"that":[55,84],"this":[56],"class":[57],"has":[58],"canonical":[59,99],"representatives,":[60],"can":[62],"always":[63],"be":[64],"constructed":[65],"via":[66],"finite":[68],"number":[69],"observations.":[71],"property":[73,89],"enables":[74],"algorithms,":[77],"makes":[79],"up":[80],"fact":[83],"residuality":[85,122],"--":[86,90],"semantic":[88],"undecidable":[92],"Our":[96],"construction":[97],"automata":[101,139],"based":[103],"on":[104],"machine-independent":[106],"characterisation":[107],"languages,":[110],"new":[115],"results":[116],"lattice":[119],"theory.":[120],"Studying":[121],"context":[125],"step":[131],"towards":[132],"better":[134],"understanding":[135],"learnability":[137],"with":[140],"some":[141],"sort":[142],"nondeterminism.":[144]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2022-02-08T00:00:00"}