{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195146,0.001143514,0.001234536,0.001780201,0.002576982,0.0062264,0.00171629,0.001957156,0.02776354],"category_scores_gemma":[0.004598434,0.001527729,0.001996548,0.002806869,0.004514458,0.01211059,0.004769742,0.003826132,0.01079014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00147444,"about_ca_system_score_gemma":0.001818817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001951206,"about_ca_topic_score_gemma":0.001733984,"domain_scores_codex":[0.9979725,0.0004767589,0.0001898361,0.0006121311,0.0005103577,0.0002383641],"domain_scores_gemma":[0.9967777,0.001264273,0.0001084716,0.001300594,0.0004063113,0.000142702],"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.00002624161,0.000016608,0.00009216771,0.00003453564,0.00000804795,0.00007763187,0.0003151858,0.0009701005,0.0005882293,0.9847162,0.002640127,0.01051501],"study_design_scores_gemma":[0.00001071377,0.000007616871,0.0000283467,0.00001292592,0.00001529222,0.00006635888,0.00006434718,0.003404884,0.00119496,0.9800552,0.0151255,0.00001390849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03316611,0.0006734469,0.8171535,0.00289825,0.0006445695,0.0002438595,0.002703742,0.007434499,0.1350821],"genre_scores_gemma":[0.6377265,0.001098941,0.2095334,0.001068791,0.0005581848,0.0005738629,0.003592442,0.003933571,0.1419142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02776354,"threshold_uncertainty_score":0.09287834,"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."}}