{"id":"W1994122595","doi":"10.1142/s0129054103002138","title":"COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unary operation; Mathematics; Combinatorics; Deterministic finite automaton; Upper and lower bounds; Alphabet; Discrete mathematics; Integer (computer science); Nondeterministic finite automaton; Quantum finite automata; Regular language; Automaton; Finite-state machine; Algorithm; Automata theory; Computer science; 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":[],"consensus_categories":[],"category_scores_codex":[0.001922421,0.00009093989,0.0001563383,0.0002152208,0.0001467022,0.000285284,0.002782609,0.00001713435,0.00003230218],"category_scores_gemma":[0.0002121057,0.0000659146,0.00009508502,0.0005731835,0.0004433037,0.001452326,0.0002186698,0.0001091187,0.00000417379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005783373,"about_ca_system_score_gemma":0.0003630059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000145507,"about_ca_topic_score_gemma":5.124869e-7,"domain_scores_codex":[0.9979036,0.00007440156,0.0006288887,0.0001582283,0.001070407,0.0001644004],"domain_scores_gemma":[0.9968911,0.0004220297,0.000824215,0.0002612159,0.001548362,0.00005310276],"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.000029449,0.0005286501,0.009638851,0.00001917819,0.0002648208,0.00001977595,0.005110201,0.008294003,0.03103008,0.8417147,0.003535754,0.09981458],"study_design_scores_gemma":[0.002436276,0.0004055428,0.01597291,0.0005328616,0.00005248146,0.001764925,0.0008350748,0.693938,0.1205649,0.1369701,0.02584009,0.0006868625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2729831,0.00006364044,0.7242616,0.0009913943,0.001149977,0.0000327773,0.000002737111,0.000008717349,0.0005061388],"genre_scores_gemma":[0.8779517,0.00001841041,0.1217823,0.0001627482,0.00006297246,6.49384e-7,7.292062e-7,0.000003175372,0.00001735308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7047446,"threshold_uncertainty_score":0.5170826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009420720844945022,"score_gpt":0.2876393450828633,"score_spread":0.2782186242379183,"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."}}