{"id":"W2037872771","doi":"10.1016/s0304-3975(00)00292-9","title":"Minimal cover-automata for finite languages","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deterministic automaton; Deterministic finite automaton; Nondeterministic finite automaton; Cover (algebra); Two-way deterministic finite automaton; Büchi automaton; DFA minimization; ω-automaton; Regular language; Quantum finite automata; Finite-state machine; Nested word; Automaton; Mathematics; Discrete mathematics; Computer science; Timed automaton; Automata theory; Theoretical computer science; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506819,0.000211451,0.0002309924,0.0001799845,0.0004246264,0.0006097996,0.003286829,0.00005907168,0.00006933901],"category_scores_gemma":[0.0001915241,0.0001714478,0.0001036467,0.0009447043,0.001535342,0.0008561254,0.001015378,0.0001213158,0.0002013676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004040587,"about_ca_system_score_gemma":0.0001028816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002026117,"about_ca_topic_score_gemma":1.914381e-7,"domain_scores_codex":[0.9975528,0.00006496729,0.0002729378,0.0007925907,0.0005601638,0.0007565017],"domain_scores_gemma":[0.9976035,0.0008604829,0.00007285747,0.001057976,0.0001438315,0.0002613954],"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.00001440204,0.00006331205,0.00003169626,0.000006545579,0.000003567015,0.00001870272,0.0002150439,0.00009821014,0.0006721432,0.9305323,0.00032408,0.06801994],"study_design_scores_gemma":[0.0004370485,0.0002925964,0.0004094237,0.00002530984,0.000004675978,0.00007883849,0.00001152863,0.8375713,0.003818084,0.1538194,0.003249617,0.0002821213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02922505,0.0000495616,0.9620371,0.001565727,0.0005254345,0.0002241961,0.000006470128,0.0005192121,0.005847239],"genre_scores_gemma":[0.8030336,0.000007879313,0.1952347,0.00141621,0.000213682,0.00001617517,0.000001984429,0.00001019614,0.00006560934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8374731,"threshold_uncertainty_score":0.6991439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0108842540742893,"score_gpt":0.2659373913081476,"score_spread":0.2550531372338584,"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."}}