{"id":"https://openalex.org/W4415642505","doi":"https://doi.org/10.46298/lmcs-21(4:13)2025","title":"A Hierarchy of Nondeterminism","display_name":"A Hierarchy of Nondeterminism","publication_year":2025,"publication_date":"2025-10-28","ids":{"openalex":"https://openalex.org/W4415642505","doi":"https://doi.org/10.46298/lmcs-21(4:13)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:13)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:13)2025","pdf_url":"https://lmcs.episciences.org/16810/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/16810/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040226189","display_name":"Bader Abu Radi","orcid":"https://orcid.org/0000-0001-8138-9406"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bader Abu Radi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077429082","display_name":"Orna Kupferman","orcid":"https://orcid.org/0000-0003-4699-6117"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Orna Kupferman","raw_affiliation_strings":["School of Engineering and Computer Science , Hebrew University , Jerusalem , Israel"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computer Science , Hebrew University , Jerusalem , Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027156530","display_name":"Ofer Leshkowitz","orcid":"https://orcid.org/0000-0001-9225-2325"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ofer Leshkowitz","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040226189"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33688053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","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.8407999873161316,"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.8407999873161316,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.04010000079870224,"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/T10126","display_name":"Logic, programming, and type systems","score":0.039799999445676804,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8192999958992004},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6205999851226807},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5609999895095825},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5205000042915344},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5012999773025513},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.49549999833106995},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4708999991416931},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.4691999852657318},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4681999981403351}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8192999958992004},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6205999851226807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6172000169754028},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5609999895095825},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5307000279426575},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5205000042915344},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5012999773025513},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.49549999833106995},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4708999991416931},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4691999852657318},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4681999981403351},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.454800009727478},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4406000077724457},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.3741999864578247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3634999990463257},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.359499990940094},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3231000006198883},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.3174000084400177},{"id":"https://openalex.org/C176053320","wikidata":"https://www.wikidata.org/wiki/Q2878515","display_name":"Analytical hierarchy","level":3,"score":0.3165000081062317},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.31040000915527344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3077999949455261},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.30000001192092896},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.257999986410141}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-21(4:13)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:13)2025","pdf_url":"https://lmcs.episciences.org/16810/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"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:13)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:13)2025","pdf_url":"https://lmcs.episciences.org/16810/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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415642505.pdf","grobid_xml":"https://content.openalex.org/works/W4415642505.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,126,139,202],"study":[1,127,146],"three":[2,120],"levels":[3,121,153],"in":[4,47,66,76,83,99,110,122,154,168,197],"a":[5,22,48,166,169,175,191,195],"hierarchy":[6,124,129,143],"of":[7,31,74,91,102,150,161,165,178,185],"nondeterminism:":[8],"A":[9],"nondeterministic":[10,42,64,207],"automaton":[11,24],"$\\mathcal{A}$":[12,27,35,57,67],"is":[13,36,58,144,200],"determinizable":[14],"by":[15,28],"pruning":[16],"(DBP)":[17],"if":[18,40,62],"we":[19,173],"can":[20,44,85,210],"obtain":[21],"deterministic":[23,38,60,80],"equivalent":[25,70],"to":[26,69,206],"removing":[29],"some":[30,89],"its":[32,41],"transitions.":[33],"Then,":[34],"history":[37],"(HD)":[39],"choices":[43,65],"be":[45,211],"resolved":[46],"way":[49],"that":[50,141,190,209],"only":[51],"depends":[52],"on":[53,116,136,194],"the":[54,100,119,123,128,142,147,151,159,163,179,183,188,198,204],"past.":[55],"Finally,":[56,172],"semantically":[59],"(SD)":[61],"different":[63,152],"lead":[68],"states.":[71],"Some":[72],"applications":[73],"automata":[75,87,96,107,115,135,208],"formal":[77],"methods":[78],"require":[79],"automata,":[81],"yet":[82],"fact":[84],"use":[86],"with":[88,187],"level":[90,184],"nondeterminism.":[92],"For":[93,114],"example,":[94],"DBP":[95],"are":[97,108],"useful":[98,109],"analysis":[101,177],"online":[103],"algorithms,":[104],"and":[105,112,133],"HD":[106],"synthesis":[111],"control.":[113],"finite":[117],"words,":[118],"coincide.":[125],"for":[130],"B\u00fcchi,":[131],"co-B\u00fcchi,":[132],"weak":[134],"infinite":[137],"words.":[138],"show":[140],"strict,":[145],"expressive":[148],"power":[149],"it,":[155],"as":[156,158],"well":[157],"complexity":[160],"deciding":[162],"membership":[164],"language":[167,199],"given":[170],"level.":[171],"describe":[174],"probability-based":[176],"hierarchy,":[180],"which":[181],"relates":[182],"nondeterminism":[186],"probability":[189],"random":[192],"run":[193],"word":[196],"accepting.":[201],"relate":[203],"latter":[205],"used":[212],"when":[213],"reasoning":[214],"about":[215],"probabilistic":[216],"systems.":[217]},"counts_by_year":[],"updated_date":"2026-03-13T14:20:09.374765","created_date":"2025-10-29T00:00:00"}