{"id":"W1987608226","doi":"10.1016/j.tcs.2006.07.020","title":"Incremental construction of minimal deterministic finite cover automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Deterministic finite automaton; Cover (algebra); DFA minimization; Deterministic automaton; Nondeterministic finite automaton; Automaton; Finite-state machine; Quantum finite automata; Regular language; ω-automaton; Büchi automaton; Two-way deterministic finite automaton; Computer science; Nested word; Algorithm; Mathematics; Discrete mathematics; Automata theory; Theoretical computer science","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009782008,0.0001841406,0.0002408886,0.0002039393,0.0002404007,0.0002503019,0.001923859,0.00005234165,0.00006939721],"category_scores_gemma":[0.0000581478,0.0001585357,0.00007630508,0.000826978,0.003913573,0.0006729653,0.0009688875,0.0001149563,0.00007759108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004859085,"about_ca_system_score_gemma":0.0001225399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008248891,"about_ca_topic_score_gemma":2.110977e-7,"domain_scores_codex":[0.9977141,0.00009172531,0.0004301222,0.0005864743,0.00071143,0.0004661253],"domain_scores_gemma":[0.9984519,0.0003861014,0.0001506539,0.0007648161,0.0001216863,0.0001248655],"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.00000898094,0.00007695128,0.0001548839,0.000009869696,0.000002530875,0.00001021936,0.00005941973,0.0001269904,0.004436084,0.9734037,0.00005884381,0.02165154],"study_design_scores_gemma":[0.0003379468,0.0002242968,0.002904559,0.00003356347,0.000006258346,0.00009450915,0.000004901187,0.7235513,0.02824745,0.2443318,0.00005501642,0.00020839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2390825,0.00001127872,0.7554189,0.0001377303,0.0004880059,0.00009620809,0.0000061171,0.000183267,0.004575987],"genre_scores_gemma":[0.8042331,9.987046e-7,0.1955171,0.0001390595,0.00009293064,0.000002841919,0.000001434478,0.000005738808,0.000006787021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7290719,"threshold_uncertainty_score":0.9987972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005976703962465163,"score_gpt":0.2199071007742895,"score_spread":0.2139303968118243,"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."}}