{"id":"W2922460544","doi":"10.1016/j.ic.2019.03.003","title":"On store languages and applications","year":2019,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Nondeterministic algorithm; Pushdown automaton; Bounded function; Reachability; Set (abstract data type); Successor cardinal; Finite-state machine; Automaton; Theoretical computer science; Deterministic pushdown automaton; Decidability; Programming language; Algorithm; Nondeterministic finite automaton; Mathematics; Automata theory","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.00007370739,0.00004110361,0.00003950312,0.00006560909,0.00004871401,0.0001310491,0.00006093546,0.00001918825,0.000004510307],"category_scores_gemma":[0.00000343862,0.00003634586,0.000006614926,0.00007543212,0.000008887541,0.0007596664,0.00003204327,0.00003070129,0.0001189905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000634025,"about_ca_system_score_gemma":0.000006511489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000314863,"about_ca_topic_score_gemma":2.025057e-7,"domain_scores_codex":[0.9997218,0.000009362812,0.00008631779,0.00006134502,0.0000740574,0.00004707834],"domain_scores_gemma":[0.9997788,0.00004943921,0.00004684719,0.0000782408,0.00002284256,0.00002385026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001442821,0.000004496605,0.0001226041,0.00001460369,0.000001799319,5.851425e-8,0.0006518221,0.00042717,0.00001581559,0.4951955,0.0001516493,0.5034131],"study_design_scores_gemma":[0.0008300374,0.0001491207,0.03185308,0.00003213757,0.000003354023,0.00002491223,0.000832604,0.8841264,0.0001717267,0.06004107,0.02169232,0.0002432931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2049474,0.00004957992,0.7870558,0.0002831203,0.00005004173,0.0001867351,0.000001837561,0.0001323077,0.007293222],"genre_scores_gemma":[0.9962361,0.000008064491,0.002776021,0.0009103625,0.000009794045,0.00000976904,0.00001570112,0.00000119238,0.00003300061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8836992,"threshold_uncertainty_score":0.1529422,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003813228071605732,"score_gpt":0.2394666220793819,"score_spread":0.2356533940077762,"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."}}