{"id":"W2999574320","doi":"10.1016/j.tcs.2018.05.036","title":"On store languages of language acceptors","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pushdown automaton; Computer science; Nondeterministic algorithm; Regular language; Programming language; Nondeterministic finite automaton; Set (abstract data type); Finite-state machine; Theoretical computer science; Automaton; 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009832266,0.0001440924,0.0001790044,0.0001933798,0.0001949763,0.0001449541,0.002691018,0.00004084436,0.0001956704],"category_scores_gemma":[0.00011406,0.000106572,0.00005795026,0.0008951027,0.003390773,0.0003708842,0.0008027247,0.00011476,0.0001648208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002875732,"about_ca_system_score_gemma":0.00005985626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000459177,"about_ca_topic_score_gemma":3.847595e-7,"domain_scores_codex":[0.9982182,0.0000788725,0.0001972194,0.0005082568,0.0005941416,0.0004032502],"domain_scores_gemma":[0.9984033,0.000276779,0.00007269127,0.0009662089,0.000122794,0.0001582621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00000671022,0.00004479624,0.0000174829,0.000003650114,0.000002402444,0.000006726547,0.001539974,0.000005347666,0.003533692,0.9407792,0.0001360453,0.05392399],"study_design_scores_gemma":[0.0005584349,0.001895856,0.00358383,0.0001350172,0.000007833718,0.00004497863,0.000190565,0.3086961,0.3474531,0.3366771,0.0001574103,0.0005998439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4276289,0.00001910101,0.5621289,0.0002171464,0.0004121638,0.00006761241,0.000001770443,0.0001768766,0.009347512],"genre_scores_gemma":[0.951592,7.301319e-7,0.04750401,0.0006902498,0.0001874282,0.000001732313,3.807849e-7,0.000006526738,0.00001697054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6041021,"threshold_uncertainty_score":0.9993214,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005652122416816928,"score_gpt":0.2664795864860257,"score_spread":0.2608274640692088,"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."}}