{"id":"https://openalex.org/W2724853801","doi":"https://doi.org/10.1051/ita/2017006","title":"The determinacy strength of pushdown<i>\u03c9</i>-languages","display_name":"The determinacy strength of pushdown<i>\u03c9</i>-languages","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2724853801","doi":"https://doi.org/10.1051/ita/2017006","mag":"2724853801"},"language":"en","primary_location":{"id":"doi:10.1051/ita/2017006","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita/2017006","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X","2804-7346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","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/A5100431492","display_name":"Wenjuan Li","orcid":"https://orcid.org/0000-0002-3833-2794"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Wenjuan Li","raw_affiliation_strings":["Mathematical Institute, Tohoku University, 6-3, Aramaki Aza-Aoba, Aoba-ku, Sendai 980-8578, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute, Tohoku University, 6-3, Aramaki Aza-Aoba, Aoba-ku, Sendai 980-8578, Japan","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110462436","display_name":"Kazuyuki Tanaka","orcid":null},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kazuyuki Tanaka","raw_affiliation_strings":["Mathematical Institute, Tohoku University, 6-3, Aramaki Aza-Aoba, Aoba-ku, Sendai 980-8578, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute, Tohoku University, 6-3, Aramaki Aza-Aoba, Aoba-ku, Sendai 980-8578, Japan","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I201537933"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10935556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"51","issue":"1","first_page":"29","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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.9987000226974487,"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/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.8508061170578003},{"id":"https://openalex.org/keywords/determinacy","display_name":"Determinacy","score":0.845663845539093},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7950367331504822},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6160828471183777},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6088445782661438},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6014646291732788},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5773876309394836},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5533108115196228},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3675854802131653},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3308505415916443},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.28727900981903076},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.26329314708709717},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20156356692314148},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19037404656410217},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.14452078938484192},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.0859358012676239},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.07608357071876526},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.0760425329208374},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06299147009849548}],"concepts":[{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.8508061170578003},{"id":"https://openalex.org/C58468513","wikidata":"https://www.wikidata.org/wiki/Q1201165","display_name":"Determinacy","level":2,"score":0.845663845539093},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7950367331504822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6160828471183777},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6088445782661438},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6014646291732788},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5773876309394836},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5533108115196228},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3675854802131653},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3308505415916443},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.28727900981903076},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.26329314708709717},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20156356692314148},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19037404656410217},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.14452078938484192},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.0859358012676239},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.07608357071876526},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.0760425329208374},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06299147009849548},{"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/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ita/2017006","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita/2017006","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X","2804-7346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:ITA_2017__51_1_29_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ita/2017006/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4050025873","display_name":"Phase transitions of provability and supercritical propositions of reverse mathematics","funder_award_id":"15H03634","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W56613915","https://openalex.org/W77390324","https://openalex.org/W113173227","https://openalex.org/W643812077","https://openalex.org/W1508555606","https://openalex.org/W1515759392","https://openalex.org/W1588784669","https://openalex.org/W1630483081","https://openalex.org/W1725438563","https://openalex.org/W1869661405","https://openalex.org/W1884709457","https://openalex.org/W1968642103","https://openalex.org/W2004845705","https://openalex.org/W2010390468","https://openalex.org/W2012140001","https://openalex.org/W2022934640","https://openalex.org/W2061970672","https://openalex.org/W2069699761","https://openalex.org/W2070641420","https://openalex.org/W2073412815","https://openalex.org/W2085702534","https://openalex.org/W2087579839","https://openalex.org/W2087879437","https://openalex.org/W2088846354","https://openalex.org/W2107093575","https://openalex.org/W2107398710","https://openalex.org/W2125267391","https://openalex.org/W2143679847","https://openalex.org/W2151033407","https://openalex.org/W2162168838","https://openalex.org/W2243005836","https://openalex.org/W2268014521","https://openalex.org/W2512356998","https://openalex.org/W2949700515","https://openalex.org/W2963204392","https://openalex.org/W2963698523","https://openalex.org/W2963717725","https://openalex.org/W3022006420","https://openalex.org/W3103530092","https://openalex.org/W3121781733","https://openalex.org/W4212901716","https://openalex.org/W4229690001","https://openalex.org/W4238689220","https://openalex.org/W4248784701","https://openalex.org/W4252769497","https://openalex.org/W4254392920"],"related_works":["https://openalex.org/W392685101","https://openalex.org/W1972232894","https://openalex.org/W2067895928","https://openalex.org/W1511257926","https://openalex.org/W2171067235","https://openalex.org/W2522490152","https://openalex.org/W2472752294","https://openalex.org/W1991406344","https://openalex.org/W1486486721","https://openalex.org/W127918926"],"abstract_inverted_index":{"We":[0],"investigate":[1,80],"the":[2,30,35,44,52,73,81,104,119,134,155,158,172],"determinacy":[3,36,82,105,135,159],"strength":[4,37],"of":[5,29,38,46,83,106,168,174],"infinite":[6,126,131],"games":[7,40,55,84,107],"whose":[8],"winning":[9,48],"sets":[10],"are":[11],"recognized":[12,56,85,108],"by":[13,43,51,57,66,86,95,109,163,179],"nondeterministic":[14,58,96],"pushdown":[15,59,70,90,110,137,194],"automata":[16,60,71,111,195],"with":[17,72,93,112,139],"various":[18],"acceptance":[19,75],"conditions,":[20],"e.g.,":[21],"safety,":[22],"reachability":[23,114],"and":[24],"co-B\u00fcchi":[25,156],"conditions.":[26,76],"In":[27],"terms":[28],"foundational":[31],"program":[32],"\u201cReverse":[33],"Mathematics\u201d,":[34],"such":[39],"is":[41,116,143,160],"measured":[42],"complexity":[45],"a":[47,113,140,175,184],"strategy":[49],"required":[50],"determinacy.":[53],"Infinite":[54],"have":[61],"some":[62],"resemblance":[63],"to":[64,118,145],"those":[65],"deterministic":[67,87],"2-stack":[68,88],"visibly":[69,89],"same":[74],"So,":[77],"we":[78,101,150,188],"first":[79],"automata,":[91],"together":[92],"that":[94,103,124,153,190],"ones.":[97],"Then,":[98],"for":[99,136,154,193,201],"instance,":[100],"prove":[102],"condition":[115,142],"equivalent":[117],"weak":[120],"K\u00f6nig":[121],"lemma,":[122],"stating":[123],"every":[125],"binary":[127],"tree":[128],"has":[129],"an":[130],"path.":[132],"While":[133],"\u03c9-languages":[138],"B\u00fcchi":[141],"known":[144],"be":[146],"independent":[147],"from":[148],"ZFC,":[149],"here":[151],"show":[152],"condition,":[157],"exactly":[161],"captured":[162],"ATR0,":[164],"another":[165],"popular":[166],"system":[167],"reverse":[169],"mathematics":[170],"asserting":[171],"existence":[173],"transfinite":[176],"hierarchy":[177],"produced":[178],"iterating":[180],"arithmetical":[181],"comprehension":[182],"along":[183],"given":[185],"well-order.":[186],"Finally,":[187],"conclude":[189],"all":[191],"results":[192],"in":[196],"this":[197],"paper":[198],"indeed":[199],"hold":[200],"1-counter":[202],"automata.":[203]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}