{"id":"W1524205571","doi":"10.1007/978-3-540-30500-2_20","title":"State Complexity and the Monoid of Transformations of a Finite Set","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Computer science; Root (linguistics); Set (abstract data type); Free monoid; Syntactic monoid; Finite-state machine; Computational complexity theory; Regular language; Finite set; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Automaton; Programming language; Linguistics","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.001403984,0.0004323439,0.0009426699,0.00200461,0.001500919,0.006253405,0.0009969234,0.00125293,0.00606335],"category_scores_gemma":[0.006796617,0.0006001476,0.00124369,0.001861277,0.004199194,0.01171307,0.002037455,0.002987951,0.0004639032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002606049,"about_ca_system_score_gemma":0.0009941189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001380459,"about_ca_topic_score_gemma":0.000911831,"domain_scores_codex":[0.9981562,0.0004503195,0.000171126,0.0003862666,0.0006447767,0.000191259],"domain_scores_gemma":[0.9902055,0.007631945,0.0005049249,0.0008516803,0.0004971717,0.0003087301],"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.00003692806,0.00001175737,0.0002571619,0.00004201168,0.000008085975,0.00002268321,0.0001922356,0.002229115,0.0004185047,0.9914277,0.0003869594,0.004967028],"study_design_scores_gemma":[0.000007232195,0.00001509298,0.000211292,0.000008018039,0.000007598041,0.0000483867,0.00003861467,0.007925639,0.0003670039,0.9897678,0.001593533,0.000009796635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4370408,0.006889935,0.3967176,0.00450526,0.0003141144,0.0001546044,0.001141464,0.0004276832,0.1528085],"genre_scores_gemma":[0.9551291,0.001411368,0.02699041,0.0001648998,0.0002921527,0.0001399445,0.0004586919,0.00006159705,0.01535178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006253405,"threshold_uncertainty_score":0.02028388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02131951859198777,"score_gpt":0.2395103496222782,"score_spread":0.2181908310302904,"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."}}