{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003577336,0.001197768,0.001857275,0.002610222,0.003711029,0.00837465,0.002786816,0.003020015,0.01864634],"category_scores_gemma":[0.01465713,0.001618457,0.002608228,0.002864589,0.006767184,0.02120485,0.006835389,0.005665912,0.002644714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002349874,"about_ca_system_score_gemma":0.001983201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002724738,"about_ca_topic_score_gemma":0.002728274,"domain_scores_codex":[0.9973701,0.0007408718,0.0002288688,0.0005125933,0.0006067036,0.0005407539],"domain_scores_gemma":[0.9863332,0.009063608,0.0005780456,0.00173031,0.00152339,0.0007714367],"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.00006563926,0.00002384089,0.0001721123,0.00003760724,0.00000604132,0.00007224851,0.0005840454,0.001047264,0.0004743492,0.993386,0.001004408,0.003126513],"study_design_scores_gemma":[0.0000178892,0.00001556794,0.00005095202,0.00001824014,0.00001211787,0.0000517509,0.0001541176,0.00520855,0.0003403869,0.9920253,0.002091807,0.00001328652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2171744,0.001620395,0.6883136,0.00652625,0.0008741674,0.0002302728,0.001337436,0.001914271,0.08200912],"genre_scores_gemma":[0.8503571,0.001338082,0.07016833,0.001576359,0.0009288221,0.000424613,0.001554433,0.00176282,0.07188955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01864634,"threshold_uncertainty_score":0.06237817,"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."}}