{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000515743,0.0003848526,0.0006716189,0.0008155622,0.0008884303,0.001268232,0.001654212,0.0006690615,0.005288744],"category_scores_gemma":[0.003046844,0.0006272619,0.001102457,0.0006192916,0.0009394201,0.002133382,0.002874186,0.001231818,0.0008689173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008816931,"about_ca_system_score_gemma":0.0007509924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008433954,"about_ca_topic_score_gemma":0.001961632,"domain_scores_codex":[0.9991952,0.0001530709,0.00005445943,0.0001571343,0.0003059091,0.000134329],"domain_scores_gemma":[0.9971577,0.001681728,0.00008232102,0.0005792496,0.000349261,0.0001497579],"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.000609514,0.0003999709,0.002718736,0.0006753149,0.0001037686,0.0007204108,0.001410529,0.03907689,0.06970028,0.6746646,0.008653372,0.2012666],"study_design_scores_gemma":[0.0001026943,0.0001481542,0.001306982,0.0001062445,0.0001903324,0.0004506685,0.0003160746,0.3067164,0.07141004,0.5891588,0.03002179,0.00007177589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1962864,0.0003083599,0.7773628,0.0005303638,0.0001072604,0.0002190486,0.000819237,0.003578256,0.02078829],"genre_scores_gemma":[0.6638375,0.0001857906,0.3277977,0.00009672502,0.00003984633,0.0002834273,0.001567975,0.0004281387,0.005762884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005288744,"threshold_uncertainty_score":0.01769263,"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."}}