{"id":"https://openalex.org/W2811303545","doi":"https://doi.org/10.1142/s0129054118410101","title":"Nondeterministic Ordered Restarting Automata","display_name":"Nondeterministic Ordered Restarting Automata","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2811303545","doi":"https://doi.org/10.1142/s0129054118410101","mag":"2811303545"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054118410101","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118410101","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002395022","display_name":"Kent Kwee","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Kent Kwee","raw_affiliation_strings":["Fachbereich Elektrotechnik/Informatik, Universit\u00e4t Kassel, 34109 Kassel, Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Elektrotechnik/Informatik, Universit\u00e4t Kassel, 34109 Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111446858","display_name":"Friedrich Otto","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Friedrich Otto","raw_affiliation_strings":["Fachbereich Elektrotechnik/Informatik, Universit\u00e4t Kassel, 34109 Kassel, Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Elektrotechnik/Informatik, Universit\u00e4t Kassel, 34109 Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002395022"],"corresponding_institution_ids":["https://openalex.org/I106157433"],"apc_list":null,"apc_paid":null,"fwci":0.8078,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74789147,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"29","issue":"04","first_page":"663","last_page":"685"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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/T12029","display_name":"DNA and Biological Computing","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10911","display_name":"Chemical Synthesis and Analysis","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7266092300415039},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5991060733795166},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5855562090873718},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5820714235305786},{"id":"https://openalex.org/keywords/stateless-protocol","display_name":"Stateless protocol","score":0.5429967641830444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5232887864112854},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5222737789154053},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5085211992263794},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5041652917861938},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4756945073604584},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.46024957299232483},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.4400932490825653},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4224064350128174},{"id":"https://openalex.org/keywords/abstract-family-of-languages","display_name":"Abstract family of languages","score":0.414615273475647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3946727216243744},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3447514772415161},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3196946382522583},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.2611469030380249},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2524951100349426},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.21827596426010132},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1843104362487793},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16813170909881592},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.13936972618103027},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06682246923446655}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7266092300415039},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5991060733795166},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5855562090873718},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5820714235305786},{"id":"https://openalex.org/C103613024","wikidata":"https://www.wikidata.org/wiki/Q230924","display_name":"Stateless protocol","level":3,"score":0.5429967641830444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5232887864112854},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5222737789154053},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5085211992263794},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5041652917861938},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4756945073604584},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.46024957299232483},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.4400932490825653},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4224064350128174},{"id":"https://openalex.org/C199163288","wikidata":"https://www.wikidata.org/wiki/Q3065587","display_name":"Abstract family of languages","level":5,"score":0.414615273475647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3946727216243744},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3447514772415161},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3196946382522583},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.2611469030380249},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2524951100349426},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.21827596426010132},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1843104362487793},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16813170909881592},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.13936972618103027},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06682246923446655},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.0},{"id":"https://openalex.org/C11164408","wikidata":"https://www.wikidata.org/wiki/Q18657800","display_name":"Second-generation programming language","level":4,"score":0.0},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054118410101","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118410101","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.7400000095367432}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1970379778","https://openalex.org/W2011039300","https://openalex.org/W2014322000","https://openalex.org/W2057834256","https://openalex.org/W2066725205","https://openalex.org/W2076508310","https://openalex.org/W2155704531","https://openalex.org/W4242737157","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2047588061","https://openalex.org/W2950941115","https://openalex.org/W2229354094","https://openalex.org/W4295836506","https://openalex.org/W1804899877","https://openalex.org/W2536615479","https://openalex.org/W2022934640","https://openalex.org/W2725858194","https://openalex.org/W1994458424","https://openalex.org/W2519069132"],"abstract_inverted_index":{"While":[0],"(stateless)":[1],"deterministic":[2],"ordered":[3,17],"restarting":[4,18],"automata":[5,19,38],"accept":[6],"exactly":[7],"the":[8,30,36,49,51,54,64,89],"regular":[9],"languages,":[10],"it":[11],"has":[12],"been":[13],"observed":[14],"that":[15,29,45,63,78],"nondeterministic":[16,85],"(ORWW-automata":[20],"for":[21,69,88],"short)":[22],"are":[23],"more":[24],"expressive.":[25],"Here":[26],"we":[27,74],"show":[28],"class":[31],"of":[32,43],"languages":[33,44,57],"accepted":[34],"by":[35],"latter":[37],"is":[39,46,67],"an":[40],"abstract":[41],"family":[42],"incomparable":[47],"to":[48,60],"linear,":[50],"context-free,":[52],"and":[53,62],"growing":[55],"context-sensitive":[56],"with":[58],"respect":[59],"inclusion,":[61],"emptiness":[65],"problem":[66],"decidable":[68],"these":[70],"languages.":[71],"In":[72],"addition,":[73],"give":[75],"a":[76,80,84],"construction":[77],"turns":[79],"stateless":[81],"ORWW-automaton":[82],"into":[83],"finite-state":[86],"acceptor":[87],"same":[90],"language.":[91]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}