{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001169442,0.0005819949,0.0006287172,0.000589735,0.0003586711,0.0008438286,0.003519479,0.0003580837,0.00002230162],"category_scores_gemma":[0.0001472156,0.0005429531,0.0002126419,0.0003563631,0.0005840887,0.0009324622,0.0006430454,0.0003845638,0.00001522361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001576493,"about_ca_system_score_gemma":0.000417912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001093521,"about_ca_topic_score_gemma":0.00001117264,"domain_scores_codex":[0.996209,0.00003048141,0.0005537244,0.001726753,0.0005922409,0.0008877537],"domain_scores_gemma":[0.9958239,0.001898205,0.0003690755,0.00143816,0.000269329,0.000201387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007239262,0.00002798723,0.00000772433,0.00004105941,0.00001343406,0.00003060533,0.0003936386,0.002678802,0.0001689495,0.02272262,0.00005507752,0.9738529],"study_design_scores_gemma":[0.0006461903,0.0003773731,0.000008444968,0.0002295249,0.00001361621,0.0001184747,0.000001801697,0.899156,0.00181176,0.09088954,0.006053097,0.0006941184],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007740156,0.0002868858,0.9950838,0.0002638611,0.001565657,0.0008603716,0.0001207636,0.0003969485,0.001344305],"genre_scores_gemma":[0.007722435,0.00001733256,0.9891807,0.001535764,0.001060454,0.00004493317,0.00004254064,0.00005898331,0.0003368463],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9731587,"threshold_uncertainty_score":0.9997022,"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."}}