{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009460466,0.0009874104,0.001682845,0.001862156,0.002880252,0.004486844,0.001537513,0.002042355,0.008827207],"category_scores_gemma":[0.004923667,0.00109944,0.002052828,0.001912631,0.002939269,0.008575628,0.002706598,0.003608861,0.001082774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002134868,"about_ca_system_score_gemma":0.0009888456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001347221,"about_ca_topic_score_gemma":0.001888459,"domain_scores_codex":[0.9986602,0.0002769654,0.00009828229,0.0003225842,0.0004357743,0.0002061214],"domain_scores_gemma":[0.9937237,0.004780998,0.0002812959,0.0004844447,0.0003709378,0.0003586038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001225765,0.00004471388,0.0003886566,0.0001147158,0.00002915832,0.000167238,0.0009094427,0.002699685,0.001859059,0.9827291,0.002038885,0.00889665],"study_design_scores_gemma":[0.0000173487,0.00001120157,0.0001078194,0.00001170802,0.00001675705,0.00007281653,0.00007497179,0.007618218,0.0005443098,0.9897639,0.001751396,0.000009596938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3125212,0.003507225,0.6133115,0.004274701,0.0003190455,0.0001913345,0.002053621,0.002220005,0.06160133],"genre_scores_gemma":[0.9179646,0.000933816,0.06260452,0.0004572382,0.0003987619,0.0003407906,0.002337421,0.0003716567,0.01459129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008827207,"threshold_uncertainty_score":0.02952993,"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."}}