{"id":"W2084869467","doi":"10.1016/j.tcs.2009.02.035","title":"State complexity of unique rational operations","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; State (computer science); Regular language; Theoretical computer science; Computational complexity theory; Time complexity; Algorithm; Automaton","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001147484,0.0001241387,0.0001738267,0.0001429634,0.0002986684,0.0002406569,0.001963773,0.00002533775,0.00004518105],"category_scores_gemma":[0.00004958958,0.000101253,0.00005137741,0.0008929608,0.002826462,0.000768399,0.0003689803,0.0001179709,0.00002335742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003070007,"about_ca_system_score_gemma":0.0001762544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003554347,"about_ca_topic_score_gemma":7.569776e-7,"domain_scores_codex":[0.9983115,0.0001059093,0.0002945164,0.0004251085,0.0005338583,0.0003290944],"domain_scores_gemma":[0.9987822,0.0001133392,0.00004690816,0.0006556241,0.0002387039,0.0001632841],"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.000002960601,0.00007215558,0.000007673122,0.000001498595,0.00000140301,0.000002579631,0.0002878467,0.0009712277,0.004035764,0.9760846,0.0000246438,0.01850767],"study_design_scores_gemma":[0.00008291924,0.0001261996,0.002369565,0.000008872354,8.055092e-7,0.00001263408,0.00000146476,0.4816848,0.01325023,0.502366,0.00001198822,0.00008455592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07318714,0.00001024772,0.9221135,0.002353651,0.0001710845,0.0001082022,0.00000357761,0.0001410999,0.00191149],"genre_scores_gemma":[0.7340912,0.000001596552,0.2650262,0.0008396356,0.00003095222,0.000001270668,0.000001145271,0.000001929481,0.000006059822],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.660904,"threshold_uncertainty_score":0.9998873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01915976598684302,"score_gpt":0.2675043142512131,"score_spread":0.2483445482643701,"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."}}