{"id":"W2007370828","doi":"10.1016/s0304-3975(02)00326-2","title":"Alternating and empty alternating auxiliary stack automata","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Stack (abstract data type); PSPACE; Automaton; Polynomial hierarchy; Bounded function; Hierarchy; Constant (computer programming); Mathematics; Combinatorics; Discrete mathematics; Time complexity; Computer science; Theoretical computer science; Computational complexity theory; Algorithm; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00208846,0.0007657876,0.0008274931,0.001139691,0.002751312,0.004823849,0.001840299,0.001815144,0.01173765],"category_scores_gemma":[0.009943795,0.0007774319,0.001374723,0.001207827,0.004543769,0.01612424,0.004218632,0.003663096,0.001666899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007652905,"about_ca_system_score_gemma":0.001124764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005312208,"about_ca_topic_score_gemma":0.0006449165,"domain_scores_codex":[0.9981912,0.0004280298,0.0002042954,0.0003503298,0.0004077086,0.0004184389],"domain_scores_gemma":[0.9913887,0.004426649,0.0005272051,0.001578078,0.001307116,0.0007722249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001789695,0.00003933013,0.0003285521,0.00003646292,0.00000664551,0.0001199591,0.0005756085,0.0007699691,0.00184513,0.9892067,0.0008633074,0.006029427],"study_design_scores_gemma":[0.0000208341,0.00002890714,0.0001697092,0.00001190535,0.00002734934,0.0001736196,0.0001950556,0.008922322,0.002933662,0.9838204,0.003674126,0.00002208732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.416687,0.0006487797,0.5020107,0.001548434,0.000562473,0.0001152916,0.0007649336,0.001435055,0.07622731],"genre_scores_gemma":[0.9195094,0.0002974661,0.04963225,0.0002708217,0.0001940259,0.0001567401,0.0005553172,0.0003844676,0.02899952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01173765,"threshold_uncertainty_score":0.03926635,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00864102512398008,"score_gpt":0.2464092142093319,"score_spread":0.2377681890853519,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}