{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00132596,0.0001529611,0.0002352665,0.0001605527,0.0001891705,0.0001921267,0.002950593,0.00002816271,0.00005419795],"category_scores_gemma":[0.00004366805,0.0001206516,0.00007282802,0.001056719,0.003881865,0.0006296664,0.0005948455,0.0001323184,0.00004602071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002720655,"about_ca_system_score_gemma":0.00008314677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000162637,"about_ca_topic_score_gemma":8.405154e-8,"domain_scores_codex":[0.9979284,0.00008090599,0.0003040634,0.0005303476,0.0006576062,0.0004986753],"domain_scores_gemma":[0.9984318,0.0001203853,0.00009085603,0.0009751833,0.0001661201,0.0002156262],"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.000004950199,0.00007492788,0.00001227856,0.000001808983,0.000001469268,0.000006338805,0.0003597648,0.00003188999,0.002626735,0.9495188,0.00003544216,0.04732559],"study_design_scores_gemma":[0.000138035,0.0003205994,0.006693724,0.00001682772,0.000001148034,0.00002151973,0.000002612713,0.1866135,0.01649415,0.7895133,0.00003492491,0.0001495629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1244263,0.00002078096,0.8679245,0.001202503,0.0002741404,0.0000851934,0.000001729046,0.0001950934,0.005869749],"genre_scores_gemma":[0.8451315,0.000001513785,0.1539022,0.0009349496,0.00002143273,5.552679e-7,2.191285e-7,0.000002843382,0.000004806181],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7207051,"threshold_uncertainty_score":0.998829,"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."}}