{"id":"https://openalex.org/W1973956010","doi":"https://doi.org/10.1137/0220018","title":"The Power of Alternating One-Reversal Counters and Stacks","display_name":"The Power of Alternating One-Reversal Counters and Stacks","publication_year":1991,"publication_date":"1991-04-01","ids":{"openalex":"https://openalex.org/W1973956010","doi":"https://doi.org/10.1137/0220018","mag":"1973956010"},"language":"en","primary_location":{"id":"doi:10.1137/0220018","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220018","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5110211208","display_name":"\u00d3scar H. Ibarra","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Oscar H. Ibarra","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100364348","display_name":"Tao Jiang","orcid":"https://orcid.org/0000-0002-0526-4182"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao Jiang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110211208"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.49,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79749671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"2","first_page":"278","last_page":"290"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","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/T11567","display_name":"semigroups and automata theory","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/T11269","display_name":"Algorithms and Data Compression","score":0.9976000189781189,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.8973087668418884},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.6764727830886841},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6652264595031738},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.5493733882904053},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.46375492215156555},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4491059482097626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4298956096172333},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4242684841156006},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.42085713148117065},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41838520765304565},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3502058684825897},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32999515533447266},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.23652812838554382},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.15645161271095276},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14149209856987},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.12066030502319336}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.8973087668418884},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.6764727830886841},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6652264595031738},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.5493733882904053},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.46375492215156555},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4491059482097626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4298956096172333},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4242684841156006},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42085713148117065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41838520765304565},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3502058684825897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32999515533447266},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.23652812838554382},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.15645161271095276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14149209856987},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.12066030502319336},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220018","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220018","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":15,"referenced_works":["https://openalex.org/W1971842919","https://openalex.org/W1979876920","https://openalex.org/W1994332025","https://openalex.org/W1995502606","https://openalex.org/W1996878052","https://openalex.org/W2010032869","https://openalex.org/W2023999667","https://openalex.org/W2039393392","https://openalex.org/W2046750655","https://openalex.org/W2067825920","https://openalex.org/W2076858908","https://openalex.org/W2087846761","https://openalex.org/W2094082874","https://openalex.org/W4241108585","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2039777175","https://openalex.org/W2037833610","https://openalex.org/W1972481159","https://openalex.org/W1973052363","https://openalex.org/W2094468224","https://openalex.org/W1976970343","https://openalex.org/W2031826484","https://openalex.org/W1973956010","https://openalex.org/W55259022","https://openalex.org/W1584211927"],"abstract_inverted_index":{"The":[0,44,71,87],"relation":[1],"between":[2],"reversals":[3,100],"and":[4,30],"alternation":[5],"is":[6,46],"studied":[7],"in":[8],"two":[9],"simple":[10],"models":[11],"of":[12],"computation:":[13],"the":[14,31,63,75,103],"2-counter":[15],"machine":[16],"with":[17,96],"a":[18],"one-way":[19,32],"input":[20],"tape":[21],"whose":[22,35],"counters":[23],"make":[24],"only":[25,39],"one":[26,40],"reversal":[27,41],"(1-reversal":[28,42],"2CM)":[29],"pushdown":[33,36],"automaton":[34],"store":[37],"makes":[38],"PDA).":[43],"following":[45],"shown:":[47],"(a)":[48],"alternating":[49,58,79,94],"1-reversal":[50,59,80],"2CM\u2019s":[51],"accept":[52,61,82,101],"all":[53,83],"recursively":[54,84],"enumerable":[55,85],"languages;":[56],"(b)":[57],"PDA\u2019s":[60,95],"exactly":[62,102],"languages":[64],"accepted":[65],"by":[66],"exponential":[67],"time-bounded":[68],"deterministic":[69],"TM\u2019s.":[70],"first":[72],"improves":[73,89],"on":[74,99],"known":[76],"result":[77,92],"that":[78,93],"4CM\u2019s":[81],"languages.":[86,105],"second":[88],"an":[90],"earlier":[91],"no":[97],"restrictions":[98],"exponential-time":[104]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}