{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543309,0.0001533535,0.0001979304,0.0001672378,0.0002560241,0.000194406,0.001779536,0.00003182861,0.0002610512],"category_scores_gemma":[0.00003087764,0.000131599,0.00006642449,0.0009144523,0.0009902357,0.0003007968,0.0004953887,0.00009565095,0.00002873334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005263041,"about_ca_system_score_gemma":0.00007982807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003218103,"about_ca_topic_score_gemma":3.242694e-7,"domain_scores_codex":[0.9978254,0.0001225697,0.0003641253,0.0005369381,0.0007034539,0.0004474853],"domain_scores_gemma":[0.9986532,0.0002032786,0.0001188734,0.0007987797,0.00009573186,0.0001300914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004621032,0.00004782745,0.00005674055,0.00001237257,0.000005289167,0.00001480352,0.0009535726,0.01408942,0.006792406,0.772479,0.000007122323,0.2055368],"study_design_scores_gemma":[0.0003031077,0.00008568143,0.0009498731,0.00005221938,0.00000550831,0.0000274356,0.0000472079,0.9624105,0.02307857,0.01286204,0.00001510358,0.0001627279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5242873,0.00001433809,0.4747628,0.00009768378,0.0001087845,0.00008561549,0.000002469146,0.0001133175,0.0005276193],"genre_scores_gemma":[0.8086429,0.000001961565,0.1911162,0.0001716948,0.0000538724,0.000001550433,8.039104e-7,0.000006235053,0.000004858453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9483211,"threshold_uncertainty_score":0.5366452,"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."}}