{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868922,0.0005330106,0.001410203,0.001753818,0.001707381,0.007297028,0.00161404,0.001518622,0.00893812],"category_scores_gemma":[0.01371359,0.0006771678,0.001326411,0.00186037,0.003609398,0.01387572,0.003067958,0.00361443,0.0004790787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002449074,"about_ca_system_score_gemma":0.001376964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001677464,"about_ca_topic_score_gemma":0.001366223,"domain_scores_codex":[0.9976014,0.0005419389,0.0001481013,0.0004416923,0.0007935618,0.0004733461],"domain_scores_gemma":[0.9768513,0.01860655,0.001112679,0.001594577,0.001056829,0.0007780708],"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.0001370685,0.00004372275,0.0008942892,0.00005330777,0.00001542999,0.00005588546,0.0005279477,0.009701556,0.0007888151,0.9816964,0.0005576756,0.005527766],"study_design_scores_gemma":[0.00001773137,0.00001645941,0.0003977825,0.000008568397,0.00001708098,0.00003615358,0.0001073387,0.03837544,0.0007499577,0.9598572,0.000398019,0.00001823365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8479037,0.0006248886,0.1187611,0.002010637,0.00006522887,0.00005380743,0.000566901,0.0002643012,0.02974946],"genre_scores_gemma":[0.992687,0.0002100885,0.003811343,0.00005366933,0.00006467895,0.00003780347,0.0002174149,0.00003920243,0.002878699],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00893812,"threshold_uncertainty_score":0.02990103,"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."}}