{"id":"W2952917448","doi":"10.48550/arxiv.math/0306416","title":"State Complexity and the Monoid of Transformations of a Finite Set","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Syntactic monoid; Root (linguistics); Set (abstract data type); Free monoid; Finite set; Mathematics; Finite-state machine; Computer science; Discrete mathematics; Algorithm; 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.000644761,0.0001520658,0.0003495239,0.00006659909,0.00006987851,0.00003398364,0.0007401337,0.00006635672,0.00001274898],"category_scores_gemma":[0.00003955489,0.0001069112,0.0001155896,0.0001487612,0.0003773681,0.0001436647,0.0003694859,0.0002460358,0.000005319363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009175564,"about_ca_system_score_gemma":0.00006734366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001077025,"about_ca_topic_score_gemma":0.00001142585,"domain_scores_codex":[0.9988491,0.0001918739,0.0004216539,0.0002293124,0.0001597396,0.0001483354],"domain_scores_gemma":[0.9985844,0.000276332,0.0002862908,0.0007368466,0.00007689025,0.00003920191],"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.0002967336,0.0007400485,0.0675146,0.003462008,0.001137879,0.00001907072,0.1369552,0.01135095,0.002224588,0.7430018,0.001975842,0.03132125],"study_design_scores_gemma":[0.00364705,0.0001395269,0.1817261,0.000512642,0.0001323448,0.000022971,0.0005981884,0.2314538,0.01143737,0.5679332,0.001551104,0.0008456815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8374882,0.0004513327,0.1596995,0.0006343016,0.000161078,0.0002947369,0.0001272113,0.00004320367,0.001100469],"genre_scores_gemma":[0.9962811,0.0002510041,0.003197959,0.0001802973,0.000008504079,0.0000176793,0.00001274686,0.000006498388,0.00004421742],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2201029,"threshold_uncertainty_score":0.4359714,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06035698064283764,"score_gpt":0.2639145045130027,"score_spread":0.203557523870165,"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."}}