{"id":"https://openalex.org/W3021003646","doi":"https://doi.org/10.1142/s012905411940029x","title":"One-Time Nondeterministic Computations","display_name":"One-Time Nondeterministic Computations","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W3021003646","doi":"https://doi.org/10.1142/s012905411940029x","mag":"3021003646"},"language":"en","primary_location":{"id":"doi:10.1142/s012905411940029x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411940029x","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/A5016664760","display_name":"Markus Holzer","orcid":"https://orcid.org/0000-0003-4224-4014"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Holzer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026803820","display_name":"Martin Kutrib","orcid":"https://orcid.org/0000-0002-9564-2625"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Kutrib","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026803820"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66615355,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"06n07","first_page":"1069","last_page":"1089"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9980999827384949,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8911688923835754},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6174430251121521},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.613641083240509},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5672739744186401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5408857464790344},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.5398094058036804},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5291034579277039},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5163251757621765},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41730210185050964},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.41719865798950195},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.37831488251686096},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3620629906654358},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3554553985595703},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35106703639030457},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2713663578033447},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.07620406150817871},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05007925629615784},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.04814934730529785}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8911688923835754},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6174430251121521},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.613641083240509},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5672739744186401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5408857464790344},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5398094058036804},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5291034579277039},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5163251757621765},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41730210185050964},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.41719865798950195},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.37831488251686096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3620629906654358},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3554553985595703},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35106703639030457},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2713663578033447},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.07620406150817871},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05007925629615784},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.04814934730529785},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905411940029x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411940029x","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W586528178","https://openalex.org/W1517141378","https://openalex.org/W2004724199","https://openalex.org/W2006629323","https://openalex.org/W2008388355","https://openalex.org/W2011039300","https://openalex.org/W2054801208","https://openalex.org/W2090921231","https://openalex.org/W2148302312","https://openalex.org/W2149288970","https://openalex.org/W2165700161","https://openalex.org/W2276792833","https://openalex.org/W2475482660","https://openalex.org/W2488025056","https://openalex.org/W2502103274","https://openalex.org/W2632078856","https://openalex.org/W4255503374"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W1991406344","https://openalex.org/W1972232894","https://openalex.org/W2472752294","https://openalex.org/W2026528778","https://openalex.org/W2122981347","https://openalex.org/W2047588061","https://openalex.org/W2950941115","https://openalex.org/W2069535086","https://openalex.org/W1804899877"],"abstract_inverted_index":{"We":[0,50],"introduce":[1],"the":[2,28,30,45,48,52,69,108,122,134,151],"concept":[3],"of":[4,11,47,55,72,119,124,136],"one-time":[5,23,56,62,129,138],"nondeterminism":[6,13,24],"as":[7,131,133],"a":[8,38,87,125,128,137,141],"new":[9],"kind":[10],"limited":[12],"for":[14,44,80,94,111],"finite":[15,58,115],"state":[16],"machines":[17],"and":[18,61,105],"pushdown":[19,64,120],"automata.":[20],"Roughly":[21],"speaking,":[22],"means":[25],"that":[26,79,91,149],"at":[27],"outset":[29],"computation":[31],"is":[32,42,92],"nondeterministic,":[33],"but":[34],"whenever":[35],"it":[36],"performs":[37],"guess,":[39],"this":[40],"guess":[41],"fixed":[43],"rest":[46],"computation.":[49],"characterize":[51],"computational":[53],"power":[54],"nondeterministic":[57,63,89,93,126,130,139],"automata":[59],"(OTNFAs)":[60],"devices.":[65],"Moreover,":[66],"we":[67,77],"study":[68],"descriptional":[70],"complexity":[71],"these":[73],"machines.":[74],"For":[75],"instance,":[76],"show":[78],"an":[81,112],"[Formula:":[82,99],"see":[83,100],"text]-state":[84],"OTNFA":[85],"with":[86],"sole":[88],"state,":[90],"only":[95],"one":[96,143],"input":[97],"symbol,":[98],"text]":[101],"states":[102],"are":[103],"sufficient":[104],"necessary":[106],"in":[107,153],"worst":[109],"case":[110,118],"equivalent":[113],"deterministic":[114,142],"automaton.":[116],"In":[117],"automata,":[121],"conversion":[123,135],"to":[127,140,146],"well":[132],"turn":[144],"out":[145],"be":[147,156],"non-recursive,":[148],"is,":[150],"trade-offs":[152],"size":[154],"cannot":[155],"bounded":[157],"by":[158],"any":[159],"recursive":[160],"function.":[161]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}