{"id":"W1529714626","doi":"10.1007/3-540-44674-5_20","title":"An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Cover (algebra); Computer science; Deterministic finite automaton; DFA minimization; Finite-state machine; Automaton; Nondeterministic finite automaton; Regular language; Algorithm; Deterministic automaton; Time complexity; Quantum finite automata; Computational complexity theory; Formal language; Theoretical computer science; 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.000480954,0.001417394,0.001223146,0.001137663,0.001523036,0.002003822,0.002365957,0.001535922,0.01751016],"category_scores_gemma":[0.002720119,0.001172509,0.002180915,0.00163123,0.0009319995,0.004568765,0.003301915,0.002008617,0.004830102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001583569,"about_ca_system_score_gemma":0.001689865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00255849,"about_ca_topic_score_gemma":0.007367147,"domain_scores_codex":[0.9991508,0.0001413141,0.000062542,0.0002468461,0.0002627297,0.0001357768],"domain_scores_gemma":[0.9978359,0.00134255,0.00007155694,0.0004939921,0.0001736935,0.00008231128],"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.0007950127,0.0004095147,0.001511504,0.0008299671,0.0001675044,0.0002798903,0.0006711433,0.02437442,0.04486674,0.04410474,0.0280311,0.8539584],"study_design_scores_gemma":[0.0004803767,0.0003437941,0.001635566,0.0001816898,0.0003876468,0.0007375241,0.0006860913,0.5802065,0.06673067,0.3067071,0.04175058,0.0001524716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0409654,0.0003410783,0.9286821,0.0004765367,0.00009062593,0.0003994282,0.0006938896,0.01659041,0.01176057],"genre_scores_gemma":[0.1370704,0.000166862,0.8510377,0.0001955003,0.00004009663,0.000591813,0.002618554,0.001418223,0.006860818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01751016,"threshold_uncertainty_score":0.05857736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01513907673228019,"score_gpt":0.2690601439068342,"score_spread":0.253921067174554,"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."}}