{"id":"W2088999425","doi":"10.1016/j.tcs.2009.02.043","title":"State-complexity hierarchies of uniform languages of alphabet-size length","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Saint Mary's University; University of Waterloo","funders":"","keywords":"Alphabet; Regular language; Mathematics; Hierarchy; Combinatorics; Class (philosophy); State (computer science); Formal language; Discrete mathematics; Simple (philosophy); Complexity class; Chomsky hierarchy; Set (abstract data type); Finite-state machine; Automaton; Computer science; Time complexity; Theoretical computer science; Algorithm; Linguistics; Programming language; 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.001731172,0.0006361697,0.001581992,0.00335611,0.002479584,0.00692319,0.002005962,0.001727415,0.009402724],"category_scores_gemma":[0.01781381,0.001341254,0.001332856,0.002415111,0.002411987,0.009066798,0.002120502,0.002695675,0.0006476463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003737634,"about_ca_system_score_gemma":0.002008866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002908159,"about_ca_topic_score_gemma":0.004687868,"domain_scores_codex":[0.9977021,0.0004563591,0.0001520855,0.0003668354,0.0007247725,0.0005978891],"domain_scores_gemma":[0.9548262,0.03551633,0.002707631,0.002593537,0.002157003,0.002199293],"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.0005447493,0.0001939119,0.006871119,0.0002893751,0.00006519139,0.0002518159,0.002214992,0.03690384,0.01115033,0.9185119,0.003243891,0.01975894],"study_design_scores_gemma":[0.0000695414,0.00007004486,0.004909746,0.00004300614,0.00005192411,0.0002242462,0.000350692,0.1963196,0.003261982,0.7928681,0.001756504,0.00007457857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8670484,0.001021371,0.1067376,0.001809273,0.00003324317,0.0001068281,0.001834922,0.001020484,0.02038772],"genre_scores_gemma":[0.9763829,0.0003706459,0.01766631,0.0001616913,0.000099523,0.0001322215,0.001034748,0.0002127663,0.003939262],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009402724,"threshold_uncertainty_score":0.03145522,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01004360449492694,"score_gpt":0.2575917261567074,"score_spread":0.2475481216617804,"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."}}