{"id":"W2075936685","doi":"10.1142/s0129054104002352","title":"IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Mathematics; Pairwise comparison; Upper and lower bounds; Quantum finite automata; Finite-state machine; Regular language; DFA minimization; Discrete mathematics; Automaton; Finite set; Nondeterministic finite automaton; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm; Statistics","routes":{"ca_aff":true,"ca_fund":false,"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.005214772,0.002253634,0.002455468,0.002254941,0.00197186,0.004437225,0.005997188,0.002488075,0.01473714],"category_scores_gemma":[0.03692415,0.001223683,0.003560974,0.001758505,0.003025183,0.01355088,0.007027803,0.007943539,0.003848272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003075931,"about_ca_system_score_gemma":0.001960291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001167226,"about_ca_topic_score_gemma":0.00204768,"domain_scores_codex":[0.9899803,0.002259987,0.0007826881,0.002301184,0.002786044,0.001889735],"domain_scores_gemma":[0.9405286,0.04295386,0.00217539,0.01010462,0.002953701,0.001283926],"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.003746849,0.0008908327,0.006902255,0.001534344,0.0002995259,0.0007952724,0.001194542,0.182187,0.06858657,0.5023919,0.01553674,0.2159342],"study_design_scores_gemma":[0.000138081,0.000413678,0.001435792,0.0001525805,0.000284793,0.0005590525,0.0000984974,0.4743794,0.03375749,0.4764105,0.01223373,0.0001363936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1389382,0.002991854,0.8095402,0.002613927,0.0005157833,0.0002401783,0.0007667551,0.004137057,0.04025609],"genre_scores_gemma":[0.67921,0.001626218,0.2984418,0.0009892823,0.0007437643,0.0009792345,0.001694914,0.001450373,0.0148644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01473714,"threshold_uncertainty_score":0.04930061,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01561583294758278,"score_gpt":0.3180558592458944,"score_spread":0.3024400262983116,"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."}}