{"id":"W2000777414","doi":"10.1016/s0304-3975(99)00020-1","title":"Efficient implementation of regular languages using reversed alternating finite automata","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Deterministic finite automaton; Finite-state machine; Nondeterministic finite automaton; Automaton; Computer science; Representation (politics); Regular language; Theoretical computer science; Quantum finite automata; Mathematics; Algorithm; Automata theory","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.001389365,0.0006612593,0.000865205,0.0005538936,0.0007031377,0.002082808,0.00264899,0.0008442953,0.006917125],"category_scores_gemma":[0.005037375,0.0006176417,0.001070868,0.0005342061,0.0009479495,0.003450817,0.001686482,0.001490469,0.001844865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006934177,"about_ca_system_score_gemma":0.001427565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001174609,"about_ca_topic_score_gemma":0.002254272,"domain_scores_codex":[0.9978284,0.0007059341,0.0002175151,0.0003458604,0.0005256769,0.0003766037],"domain_scores_gemma":[0.9946596,0.002344672,0.0002407534,0.001786978,0.0008128985,0.0001550903],"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.002850431,0.001267073,0.002169831,0.0008621708,0.0001798674,0.0009386409,0.001311554,0.06599022,0.1827281,0.3616907,0.01394408,0.3660674],"study_design_scores_gemma":[0.0004188308,0.0004742997,0.0003462002,0.0000692209,0.0001715403,0.0002762974,0.0002728341,0.631624,0.1738688,0.1694605,0.02288041,0.0001370289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1003947,0.0001550233,0.874931,0.0002726799,0.0002000473,0.0002045658,0.0002127178,0.01530207,0.00832729],"genre_scores_gemma":[0.6188557,0.0001211769,0.3722105,0.0001762303,0.00004807175,0.0002828007,0.0006088328,0.0009453675,0.006751274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006917125,"threshold_uncertainty_score":0.02314007,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00972641191193077,"score_gpt":0.2902834371344849,"score_spread":0.2805570252225542,"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."}}