{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012593,0.00009372413,0.0001469748,0.0002975556,0.0001309524,0.0003343829,0.00384078,0.00002172191,0.00002801647],"category_scores_gemma":[0.0002914255,0.00006448875,0.000113772,0.0005368698,0.0003962793,0.001312,0.0004215983,0.0001370211,0.000009138626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008529568,"about_ca_system_score_gemma":0.0004212644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002293213,"about_ca_topic_score_gemma":0.000001433773,"domain_scores_codex":[0.9982042,0.00003770561,0.0005350542,0.0001624694,0.0009164812,0.0001440758],"domain_scores_gemma":[0.9973649,0.000435499,0.0007456368,0.00039964,0.001003103,0.00005121061],"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.00002337606,0.0004003927,0.0005888075,0.000008480725,0.0001096238,0.00001919958,0.002398279,0.01137147,0.01544152,0.8231219,0.0001310674,0.1463859],"study_design_scores_gemma":[0.003848117,0.00102856,0.04651188,0.001252135,0.00004026017,0.001209357,0.0005408663,0.6081579,0.1393748,0.1956319,0.001710347,0.0006939162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2905454,0.0000117456,0.704482,0.003099326,0.00104458,0.00004430696,0.000003340469,0.00001810963,0.0007511399],"genre_scores_gemma":[0.8839644,0.000007769985,0.1155453,0.0003192846,0.0001479243,8.833516e-7,5.732452e-7,0.000003372353,0.00001045302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.62749,"threshold_uncertainty_score":0.7137189,"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."}}