{"id":"W1973982376","doi":"10.1142/s0129054103002205","title":"EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Automaton; Deterministic context-free grammar; Computer science; Theoretical computer science; Finite-state machine; Discrete mathematics; Context-free language; Embedded pushdown automaton; Rule-based machine translation; Probabilistic automaton; Mathematics; Algorithm; Tree-adjoining grammar; Context-free grammar; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"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.0006710719,0.0003473019,0.0006760464,0.0004605113,0.0005925735,0.001701496,0.001330568,0.000668065,0.004966282],"category_scores_gemma":[0.005213489,0.0003773196,0.001087401,0.0005845705,0.001063395,0.002174249,0.0009193556,0.0009954296,0.001332896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008360513,"about_ca_system_score_gemma":0.00100052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00360429,"about_ca_topic_score_gemma":0.004544028,"domain_scores_codex":[0.9988744,0.0002679683,0.0001346621,0.0002659324,0.0003289554,0.0001280324],"domain_scores_gemma":[0.9962192,0.00236778,0.0001943723,0.0006853979,0.0004684018,0.00006484078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006711261,0.0003156771,0.001993123,0.0005150828,0.0001171693,0.0008739422,0.001154073,0.1488141,0.08282178,0.3167384,0.009413467,0.4365721],"study_design_scores_gemma":[0.0000570699,0.0001288376,0.0003469507,0.00003016959,0.00004489094,0.0002699484,0.0001583148,0.8025744,0.04696954,0.1412894,0.008078629,0.0000519614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03430723,0.000157236,0.956253,0.000161907,0.00007237868,0.0001179066,0.0001903512,0.004746158,0.003993833],"genre_scores_gemma":[0.4310754,0.0002233201,0.5628228,0.0001608454,0.00003868541,0.0001888604,0.0009866619,0.0004124661,0.004090983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004966282,"threshold_uncertainty_score":0.0166139,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01883601944256143,"score_gpt":0.310194326532439,"score_spread":0.2913583070898776,"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."}}