{"id":"W2084661883","doi":"10.1016/j.tcs.2009.02.025","title":"State complexity of power","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Combinatorics; Nondeterministic algorithm; Alphabet; Regular language; Nondeterministic finite automaton; Deterministic finite automaton; State (computer science); Upper and lower bounds; Mathematics; Finite-state machine; Function (biology); Discrete mathematics; Time complexity; Constant (computer programming); Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001624701,0.0004874102,0.001394264,0.001871648,0.002184134,0.006813908,0.00161591,0.00151327,0.01767619],"category_scores_gemma":[0.01534559,0.0006545797,0.001244447,0.002235061,0.004568551,0.01686143,0.003243303,0.00390947,0.0009522394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002296124,"about_ca_system_score_gemma":0.00113497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001739359,"about_ca_topic_score_gemma":0.0009193986,"domain_scores_codex":[0.9976265,0.0005455138,0.0001168875,0.0004955682,0.0007765798,0.0004390062],"domain_scores_gemma":[0.9813448,0.0132488,0.0007930216,0.00258976,0.001212366,0.000811311],"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.00003913016,0.00001521455,0.0003344258,0.0000205066,0.000006988806,0.00002464035,0.0002816498,0.002529822,0.0002234803,0.9930565,0.0006761466,0.002791469],"study_design_scores_gemma":[0.000008288669,0.000005753463,0.0001950282,0.000004234375,0.000007046971,0.00002323841,0.0000605721,0.01161397,0.0002483484,0.9870964,0.0007301737,0.000007025833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6160792,0.001260202,0.2102597,0.0063763,0.0001516201,0.0001044484,0.001217386,0.0005679861,0.1639833],"genre_scores_gemma":[0.9880323,0.0002075062,0.003743572,0.00009664256,0.0001174296,0.00005992917,0.0002305694,0.00007372378,0.007438301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01767619,"threshold_uncertainty_score":0.0591327,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01449947914072205,"score_gpt":0.2528344637469818,"score_spread":0.2383349846062597,"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."}}