{"id":"W3158013313","doi":"10.1142/s0129054121410045","title":"Generalizations of Checking Stack Automata: Characterizations and Hierarchies","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Decidability; Turing machine; Computer science; Automaton; Stack (abstract data type); Theoretical computer science; Bounded function; Expressive power; Pushdown automaton; Automata theory; PSPACE; Discrete mathematics; Mathematics; Computational complexity theory; Programming language; Algorithm; Computation","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":[],"consensus_categories":[],"category_scores_codex":[0.0005262134,0.00008344631,0.0001816874,0.0005562095,0.0001276836,0.000319347,0.001396185,0.00002095894,0.00001431665],"category_scores_gemma":[0.000173368,0.00007909733,0.000071187,0.0008176463,0.0003884936,0.002044528,0.000501653,0.00007708318,9.499392e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003761402,"about_ca_system_score_gemma":0.0006209204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004365334,"about_ca_topic_score_gemma":0.00000156773,"domain_scores_codex":[0.9983303,0.00005021593,0.0006064462,0.000181924,0.0007128685,0.0001182324],"domain_scores_gemma":[0.996624,0.0001497685,0.0006125754,0.0002908257,0.002250777,0.00007203918],"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.000007402383,0.0003362848,0.002405219,0.00002306923,0.000128532,0.00003091977,0.002391385,0.00393437,0.09999858,0.774386,0.0001167249,0.1162415],"study_design_scores_gemma":[0.001726847,0.0002966344,0.140316,0.0006063897,0.00004542033,0.001710214,0.0001609286,0.6531101,0.1396562,0.05795623,0.003963265,0.0004518439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2237948,0.00007456706,0.7733001,0.001644046,0.001010408,0.00002782264,0.00000886396,0.00001376137,0.0001256622],"genre_scores_gemma":[0.7551937,0.0001172229,0.2444514,0.0001081303,0.0001039932,6.666348e-7,0.000004457499,0.000003257134,0.00001714072],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7164298,"threshold_uncertainty_score":0.3225495,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01436691264429124,"score_gpt":0.2849782229624023,"score_spread":0.2706113103181111,"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."}}