{"id":"W1993598446","doi":"10.1142/s0129054102000960","title":"AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Nondeterministic finite automaton; DFA minimization; Deterministic finite automaton; Quantum finite automata; Nested word; Regular language; Finite-state machine; Automaton; Deterministic automaton; ω-automaton; Computer science; Time complexity; Algorithm; Formal language; Timed automaton; Mathematics; Theoretical computer science; Automata theory; Two-way deterministic finite automaton","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.0005039121,0.0007939643,0.000806321,0.000920982,0.0008553406,0.0008279829,0.001200887,0.001083727,0.004397714],"category_scores_gemma":[0.002467923,0.0006007711,0.001522854,0.000737509,0.0007304216,0.001940207,0.001491876,0.001145013,0.001377264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007086364,"about_ca_system_score_gemma":0.001099837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009056765,"about_ca_topic_score_gemma":0.001253835,"domain_scores_codex":[0.9991192,0.0001509349,0.00007543315,0.0002195425,0.0003222389,0.0001126369],"domain_scores_gemma":[0.9988608,0.0006272778,0.0000636001,0.0002325226,0.0001761461,0.00003964589],"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.0004886574,0.0003010889,0.001525446,0.0007791431,0.0001411153,0.0006654818,0.0009257435,0.05304085,0.07415262,0.1579688,0.01321319,0.6967978],"study_design_scores_gemma":[0.0002078506,0.0003022801,0.0005626886,0.00008051448,0.000154715,0.00118545,0.0001881682,0.6407879,0.05879257,0.2577483,0.03989161,0.00009789594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009152484,0.0001151171,0.9857879,0.00009878543,0.0000300215,0.0001721846,0.0001264927,0.002801311,0.001715783],"genre_scores_gemma":[0.1090153,0.0001120022,0.8875093,0.00007677544,0.00002766218,0.000384911,0.0008226099,0.0002474983,0.00180391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004397714,"threshold_uncertainty_score":0.01471186,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01962646832423218,"score_gpt":0.3115234385093699,"score_spread":0.2918969701851377,"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."}}