{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001130581,0.0002557467,0.0004897437,0.0003445927,0.0001308858,0.0001129813,0.00188991,0.00009358465,0.00001052707],"category_scores_gemma":[0.00004112805,0.0001750813,0.0001067817,0.0003458491,0.002335619,0.0004088449,0.000523588,0.0003413596,0.000002664815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003456198,"about_ca_system_score_gemma":0.0001748046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003612854,"about_ca_topic_score_gemma":0.00005740817,"domain_scores_codex":[0.9981396,0.00005215019,0.0005612441,0.0004668831,0.0005105403,0.0002695656],"domain_scores_gemma":[0.9976777,0.0009538322,0.0003427343,0.0008262531,0.000138285,0.0000611349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002528766,0.00002703619,0.00001637281,0.0001037835,0.00002282031,0.000004442897,0.009517547,0.03332942,0.0000800316,0.2820877,0.000009398281,0.6747762],"study_design_scores_gemma":[0.0004037759,0.00005257628,0.0001024394,0.0001471159,0.000006140086,0.00001610116,4.291992e-7,0.5956718,0.0008281733,0.4023958,0.0002137367,0.0001619172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007114626,0.0006147363,0.9958977,0.0009151752,0.000199438,0.0003012221,0.00003891893,0.00003868003,0.001282655],"genre_scores_gemma":[0.798829,0.0002303053,0.2000022,0.0007606152,0.00007607182,0.000005796654,0.000004686677,0.00001463077,0.00007678612],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7981175,"threshold_uncertainty_score":0.8605686,"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."}}