{"id":"W1525517827","doi":"10.1007/3-540-45005-x_18","title":"Improved Bounds on the Number of Automata Accepting Finite Languages","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Computer science; Pairwise comparison; Automaton; Finite-state machine; Upper and lower bounds; DFA minimization; Regular language; Quantum finite automata; Finite set; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Automata theory; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001460322,0.0004703239,0.0004695867,0.0003098363,0.0002661638,0.0004958885,0.004206223,0.0002426166,0.0000959415],"category_scores_gemma":[0.0002706491,0.0003228556,0.0001639443,0.0005510058,0.0007149677,0.0003687576,0.001118105,0.0007247315,0.00004706665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001169895,"about_ca_system_score_gemma":0.0002335374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002078993,"about_ca_topic_score_gemma":0.000009705282,"domain_scores_codex":[0.9969946,0.00007360074,0.0005076042,0.001066434,0.0007857617,0.000572067],"domain_scores_gemma":[0.9956293,0.001692031,0.0004252889,0.002026039,0.0001379132,0.00008945705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007645115,0.00006446877,0.00006704919,0.00006135587,0.00003023235,0.00005884979,0.001521256,0.003258569,0.0007279895,0.2412422,0.0001497098,0.7528106],"study_design_scores_gemma":[0.0004231217,0.0002038485,0.0001614777,0.0008000839,0.00001452743,0.0001073125,0.000002425671,0.7453526,0.008365187,0.2410444,0.002509755,0.001015232],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007153223,0.0001643799,0.9808046,0.001139442,0.0009922669,0.0002846771,0.000008570675,0.0001770511,0.01571374],"genre_scores_gemma":[0.6816595,0.00006187763,0.3046115,0.01160217,0.000570244,0.00002179873,0.000007415409,0.00009293963,0.001372619],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7517954,"threshold_uncertainty_score":0.9999223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01421766367869728,"score_gpt":0.2594135747342495,"score_spread":0.2451959110555522,"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."}}