{"id":"W1994383533","doi":"10.1142/s0129054105003157","title":"STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Syntactic monoid; Set (abstract data type); Root (linguistics); Mathematics; Free monoid; Regular language; Finite-state machine; Finite set; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; 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.001471686,0.00007101161,0.0001942643,0.0003856432,0.00008649602,0.0001133516,0.001977593,0.00001255344,0.000008947511],"category_scores_gemma":[0.00008384368,0.00004974096,0.00009518789,0.0004177895,0.001200328,0.001676235,0.0002098584,0.00008842015,0.000001031537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002805312,"about_ca_system_score_gemma":0.0002359908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001938924,"about_ca_topic_score_gemma":0.00000594435,"domain_scores_codex":[0.9982924,0.00006162865,0.0007303647,0.000100762,0.0007186124,0.00009626817],"domain_scores_gemma":[0.9973412,0.0004251824,0.0007594874,0.0002277103,0.001199472,0.00004695609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000953148,0.0002713031,0.0004570475,0.00002315582,0.0001483074,0.000002023727,0.01295353,0.03782202,0.002784705,0.6883178,0.0001400021,0.2569848],"study_design_scores_gemma":[0.001537942,0.0001403715,0.008499186,0.0001110291,0.0000129976,0.0001280247,0.00006153894,0.9016171,0.009017411,0.07816547,0.0006181339,0.0000908293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2006081,0.00006407322,0.7958196,0.002975162,0.0002989211,0.00005761475,0.00001460971,0.000005125111,0.0001567791],"genre_scores_gemma":[0.8678965,0.00005271232,0.1318979,0.000102708,0.00004291895,6.750583e-7,7.500411e-7,0.000001557998,0.00000432028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.863795,"threshold_uncertainty_score":0.4422657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02362928073566646,"score_gpt":0.2931312758776484,"score_spread":0.269501995141982,"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."}}