{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01010099,0.004508534,0.004813867,0.004632745,0.003575893,0.01055883,0.01422326,0.005026505,0.03505565],"category_scores_gemma":[0.0528238,0.002902588,0.005728125,0.003704512,0.007191224,0.03046999,0.01125952,0.01622248,0.008760187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007815981,"about_ca_system_score_gemma":0.003477831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002062008,"about_ca_topic_score_gemma":0.003902298,"domain_scores_codex":[0.9839914,0.002871462,0.001071708,0.003944992,0.004964584,0.003155832],"domain_scores_gemma":[0.8701404,0.1009742,0.00252816,0.01725513,0.005586659,0.003515524],"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.006813597,0.0009463212,0.004476468,0.001950576,0.0004436189,0.0006080615,0.001309947,0.1521816,0.03555846,0.6049186,0.04457418,0.1462185],"study_design_scores_gemma":[0.0002304508,0.0002689973,0.001305512,0.0002338311,0.0003305449,0.0003788499,0.0001419107,0.293149,0.01325385,0.678018,0.01252283,0.0001663428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09938587,0.008642907,0.7389852,0.007510298,0.002705215,0.0004460324,0.00326647,0.008621026,0.1304371],"genre_scores_gemma":[0.5912641,0.004683782,0.3290435,0.003017777,0.005024611,0.001891084,0.005165346,0.004198067,0.05571164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03505565,"threshold_uncertainty_score":0.1172729,"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."}}