{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004195503,0.001495652,0.001339224,0.002098825,0.00137498,0.002968734,0.00596679,0.00224851,0.003311525],"category_scores_gemma":[0.03263031,0.001240033,0.002811456,0.002737765,0.004388302,0.006105404,0.004431642,0.004285157,0.0004848565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00165882,"about_ca_system_score_gemma":0.001665194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001968186,"about_ca_topic_score_gemma":0.00362862,"domain_scores_codex":[0.992362,0.002063454,0.0004055564,0.002207148,0.002269489,0.0006923466],"domain_scores_gemma":[0.952359,0.03218645,0.001808967,0.01115795,0.001582139,0.0009053894],"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.003257657,0.0007128425,0.03308314,0.001114354,0.0009987438,0.00207979,0.002035385,0.2295003,0.1317147,0.3898185,0.008217406,0.1974672],"study_design_scores_gemma":[0.00009921071,0.0001865906,0.002799265,0.00004226306,0.0003431,0.000336062,0.0001449389,0.5846158,0.05228268,0.357274,0.001789913,0.00008623925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4699922,0.0003676973,0.5147634,0.0006391093,0.0001458218,0.0001623687,0.0007351488,0.007395483,0.005798789],"genre_scores_gemma":[0.8785648,0.00008803159,0.1183416,0.0001701642,0.00009169406,0.00008562262,0.0006354361,0.001067343,0.0009552017],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00596679,"threshold_uncertainty_score":0.02218819,"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."}}