{"id":"W2618109676","doi":"10.1016/j.tcs.2018.04.024","title":"Variations of checking stack automata: Obtaining unexpected decidability properties","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Undecidable problem; Decidability; Nondeterministic algorithm; Emptiness; Decision problem; Discrete mathematics; Automaton; Bounded function; Mathematics; Computer science; Combinatorics; Algorithm; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002421214,0.0001887969,0.0002731632,0.0002070189,0.0005605973,0.000368093,0.002800229,0.00005686835,0.00004764913],"category_scores_gemma":[0.0003947306,0.0001452936,0.0000694301,0.001859564,0.005083812,0.001026249,0.001496511,0.0001450031,0.00004282851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007574424,"about_ca_system_score_gemma":0.0002717466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009767314,"about_ca_topic_score_gemma":9.755988e-7,"domain_scores_codex":[0.9973019,0.0001814192,0.0004567186,0.0007346167,0.0007539283,0.0005714549],"domain_scores_gemma":[0.997528,0.0002932204,0.000148615,0.001275671,0.0005673273,0.0001871614],"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.000008257198,0.00008806562,0.0001205265,0.00001028704,0.000005779504,0.000001744629,0.002246208,0.00003456148,0.009830118,0.9654741,0.0000126076,0.0221678],"study_design_scores_gemma":[0.0002065413,0.0002709663,0.004135158,0.00006484542,0.0000048785,0.00001509925,0.00002788185,0.7870849,0.05042901,0.1575289,0.00003037078,0.0002013527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2501866,0.00001322496,0.7467503,0.0003363162,0.0004384622,0.0001444736,0.00000131242,0.0003535096,0.001775846],"genre_scores_gemma":[0.8105228,8.611974e-7,0.1891537,0.0001750412,0.0001299876,0.000006502047,3.517167e-7,0.000006837698,0.000003857337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8079451,"threshold_uncertainty_score":0.9976238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01854172525392589,"score_gpt":0.2549824974376478,"score_spread":0.2364407721837219,"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."}}