{"id":"W3026005886","doi":"10.1016/j.tcs.2019.06.024","title":"State grammars with stores","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Embedded pushdown automaton; Rule-based machine translation; Tree-adjoining grammar; L-attributed grammar; Bounded function; State (computer science); Phrase structure grammar; Indexed grammar; Context-sensitive grammar; Terminal and nonterminal symbols; Context-free grammar; Mathematics; Definite clause grammar; Production (economics); Computer science; Algorithm; Artificial intelligence","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.001119567,0.0001926095,0.0002037477,0.0001615991,0.0002122842,0.0005640226,0.002944754,0.00002807226,0.00007783381],"category_scores_gemma":[0.00001535633,0.0001294095,0.00004411298,0.001066391,0.0018475,0.0009571849,0.0009273306,0.0001753832,0.000437899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004563102,"about_ca_system_score_gemma":0.0001332006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004234404,"about_ca_topic_score_gemma":4.930027e-7,"domain_scores_codex":[0.9974991,0.00007517168,0.0001836006,0.000783558,0.0008002364,0.0006583175],"domain_scores_gemma":[0.9981908,0.000201222,0.00006194557,0.001161808,0.0001263124,0.0002578838],"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.00001010043,0.00003044818,0.0003408415,0.000005131855,0.000003549929,0.00001593652,0.0002967082,0.0002456776,0.0007056628,0.9666951,0.00002729168,0.03162353],"study_design_scores_gemma":[0.0004530312,0.0006457948,0.002926986,0.0000500241,0.000003080934,0.00009649732,0.00001130938,0.5424533,0.007182347,0.4453467,0.0003898459,0.0004410449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2553058,0.00001451274,0.7410544,0.0003943356,0.0003928187,0.0001442875,7.673069e-7,0.0002868781,0.002406235],"genre_scores_gemma":[0.82972,0.000001722541,0.1695264,0.000658862,0.00003616244,0.000003437451,3.281884e-7,0.00000840494,0.00004471399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5744141,"threshold_uncertainty_score":0.6807191,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003711201174002685,"score_gpt":0.2019940762376781,"score_spread":0.1982828750636755,"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."}}