{"id":"https://openalex.org/W7162573869","doi":"https://doi.org/10.48550/arxiv.2605.27192","title":"Tree Automata Acceptance up to Measurable Defect","display_name":"Tree Automata Acceptance up to Measurable Defect","publication_year":2026,"publication_date":"2026-05-26","ids":{"openalex":"https://openalex.org/W7162573869","doi":"https://doi.org/10.48550/arxiv.2605.27192"},"language":"en","primary_location":{"id":"pmh:oai:eprints.whiterose.ac.uk:243538","is_oa":true,"landing_page_url":"https://orcid.org/0000-0001-5256-1334>,","pdf_url":"https://eprints.whiterose.ac.uk/id/eprint/243538/1/2605.27192v1.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://eprints.whiterose.ac.uk/id/eprint/243538/1/2605.27192v1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137120399","display_name":"Anita Moyasari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moyasari, Anita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062540784","display_name":"Harsh Beohar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Beohar, Harsh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137146555","display_name":"Charles Grellois","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grellois, Charles","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058618165","display_name":"Clemens Kupke","orcid":"https://orcid.org/0000-0002-0502-391X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kupke, Clemens","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9017000198364258,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9017000198364258,"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/T10126","display_name":"Logic, programming, and type systems","score":0.030500000342726707,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.012799999676644802,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/automaton","display_name":"Automaton","score":0.6585000157356262},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.6474999785423279},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6140999794006348},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6123999953269958},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5271000266075134},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5167999863624573},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.4862000048160553},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4359999895095825}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6585000157356262},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.6474999785423279},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6140999794006348},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6123999953269958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5856000185012817},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5271000266075134},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5167999863624573},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5080999732017517},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47360000014305115},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4359999895095825},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4146000146865845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39079999923706055},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.3806999921798706},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3630000054836273},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.35589998960494995},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.32249999046325684},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.3093000054359436},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29670000076293945},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.28209999203681946},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.275299996137619}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:eprints.whiterose.ac.uk:243538","is_oa":true,"landing_page_url":"https://orcid.org/0000-0001-5256-1334>,","pdf_url":"https://eprints.whiterose.ac.uk/id/eprint/243538/1/2605.27192v1.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"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":"Preprint"},{"id":"doi:10.48550/arxiv.2605.27192","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27192","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:eprints.whiterose.ac.uk:243538","is_oa":true,"landing_page_url":"https://orcid.org/0000-0001-5256-1334>,","pdf_url":"https://eprints.whiterose.ac.uk/id/eprint/243538/1/2605.27192v1.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"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":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162573869.pdf","grobid_xml":"https://content.openalex.org/works/W7162573869.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Automata":[0],"acceptance":[1,12,39],"can,":[2],"in":[3,42,57,101,155],"several":[4],"situations":[5],"of":[6,16,26,30,76,110,128,170,173],"interest,":[7],"be":[8,54,71],"captured":[9],"game-theoretically":[10],"via":[11,135],"games.":[13,81],"The":[14],"existence":[15,25],"a":[17,27,31,35,48,55,87,95,122,132],"winning":[18,28],"strategy":[19],"for":[20],"Verifier":[21],"then":[22],"captures":[23],"the":[24,102,107,153,165,168,171],"run-tree":[29],"given":[32],"automaton":[33],"over":[34,142],"model.":[36],"However,":[37],"such":[38],"is":[40,90,94,99,114,140],"rigid,":[41],"that":[43,86,98],"it":[44],"does":[45],"not":[46],"allow":[47],"measurable":[49],"defect":[50,166],"budget,":[51],"which":[52,129,156],"can":[53,70],"challenge":[56],"software":[58],"verification.":[59],"In":[60],"this":[61],"paper,":[62],"we":[63,130],"draw":[64],"inspiration":[65],"from":[66],"how":[67],"bisimulation":[68,108],"distance":[69,109],"defined":[72,141],"as":[73,161],"an":[74],"extension":[75],"bisimilarity":[77],"to":[78],"define":[79],"epsilon-acceptance":[80],"Our":[82,118,138],"main":[83],"theorem":[84],"shows":[85],"tree":[88,96],"T":[89,113],"epsilon-accepted":[91],"iff":[92],"there":[93],"T'":[97,111],"accepted":[100],"traditional":[103],"(rigid)":[104],"sense":[105],"and":[106,112,147,150,164],"at":[115],"most":[116],"epsilon.":[117],"work":[119],"also":[120],"suggests":[121],"strong":[123],"connection":[124],"with":[125,145],"measure":[126],"theory,":[127],"give":[131],"preliminary":[133],"exploration":[134],"appropriate":[136],"examples.":[137],"framework":[139],"binary":[143,157],"trees":[144],"leaves":[146],"infinite":[148],"branches,":[149],"strictly":[151],"contains":[152],"case":[154],"nodes":[158],"are":[159],"seen":[160],"probabilistic":[162],"choice":[163],"measures":[167],"probability":[169],"set":[172],"rejected":[174],"branches.":[175]},"counts_by_year":[],"updated_date":"2026-08-29T07:29:34.045763","created_date":"2026-05-28T00:00:00"}