{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002058411,0.0005145901,0.000800002,0.002046578,0.001577662,0.005723049,0.001084153,0.001248104,0.005636349],"category_scores_gemma":[0.01268615,0.0003965877,0.001232598,0.001678203,0.004544407,0.01212213,0.00253105,0.002695326,0.0004776555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002852715,"about_ca_system_score_gemma":0.001239448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001377864,"about_ca_topic_score_gemma":0.0009704525,"domain_scores_codex":[0.9963455,0.0007687545,0.0002983646,0.0008034143,0.001293629,0.0004903711],"domain_scores_gemma":[0.9749761,0.0191683,0.00170917,0.002171916,0.001132537,0.0008420084],"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.0002198931,0.0000606659,0.002304797,0.0001400525,0.00003430066,0.0001145301,0.0007702825,0.01532343,0.003751861,0.9663628,0.000474519,0.01044285],"study_design_scores_gemma":[0.00002049912,0.00008266261,0.001206365,0.00002165005,0.00003417653,0.0001286683,0.0001623088,0.0577629,0.004415712,0.9338843,0.00223876,0.00004193438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6714723,0.001702987,0.2945961,0.002496688,0.00009595764,0.000108199,0.000673999,0.0003881255,0.02846566],"genre_scores_gemma":[0.9754593,0.0004874557,0.02007867,0.00009283747,0.0001268916,0.00009794301,0.0003303614,0.00006086886,0.003265591],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005723049,"threshold_uncertainty_score":0.02069795,"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."}}