{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003069131,0.0002592708,0.0002520857,0.0001827304,0.0006277935,0.0009725239,0.002355473,0.00005177841,0.00004491611],"category_scores_gemma":[0.000312543,0.0002177319,0.00005561528,0.0007368739,0.001797485,0.001228808,0.001427762,0.0002566734,0.00006192466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005541354,"about_ca_system_score_gemma":0.0001349596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008550457,"about_ca_topic_score_gemma":3.115998e-7,"domain_scores_codex":[0.9968033,0.0002147489,0.0003718731,0.001022373,0.0008043156,0.00078334],"domain_scores_gemma":[0.9979049,0.0004504322,0.0001177145,0.001024491,0.0001329853,0.0003695078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001448219,0.00003601172,0.000246645,0.000007746173,0.000004087397,0.00002415574,0.0003547943,0.0000657774,0.0008967755,0.9471145,0.00001497085,0.05123304],"study_design_scores_gemma":[0.0002810307,0.00009961783,0.001127942,0.00004284066,0.000003099151,0.0001589476,0.00001549547,0.6621776,0.006640702,0.3290505,0.0001212376,0.0002811063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3186312,0.00005193032,0.673343,0.0003317318,0.0005720442,0.0001069475,0.000001262143,0.0003551429,0.006606752],"genre_scores_gemma":[0.7695608,0.000008334824,0.2296862,0.0006400176,0.00007836566,0.000003666464,2.754105e-7,0.00001060923,0.00001174536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6621118,"threshold_uncertainty_score":0.937807,"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."}}