{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001404959,0.0001858041,0.0003586623,0.000190432,0.0001491219,0.0001036454,0.00289724,0.00003675827,0.00003801026],"category_scores_gemma":[0.0001279569,0.000143306,0.00009525497,0.001082556,0.004061895,0.0006106785,0.0006356706,0.0001518052,0.000008363469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000314486,"about_ca_system_score_gemma":0.0001312463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009672808,"about_ca_topic_score_gemma":5.276596e-7,"domain_scores_codex":[0.9977651,0.0001031913,0.0004293023,0.0004838625,0.0007246008,0.000493929],"domain_scores_gemma":[0.998036,0.000484003,0.000165014,0.0009570786,0.000182279,0.000175618],"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.00001061081,0.00008320442,0.00003774038,0.00001209603,0.000004110123,0.000005340661,0.0008535667,0.00006236409,0.004896654,0.9074398,0.00001580733,0.08657876],"study_design_scores_gemma":[0.0002452782,0.0005224762,0.01065563,0.00005157659,0.000003846411,0.00001821413,0.00002422448,0.1431084,0.07539335,0.7697608,0.00001870027,0.0001974147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3829685,0.00005197379,0.6121795,0.0005053939,0.0001339021,0.0001051013,0.00000642153,0.0001370015,0.003912222],"genre_scores_gemma":[0.8025662,0.000007646106,0.1971004,0.0002834275,0.00002991392,7.769588e-7,4.740192e-7,0.000003838709,0.000007317907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4195977,"threshold_uncertainty_score":0.9986485,"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."}}