{"id":"W2082796216","doi":"10.1142/s0129054108006169","title":"STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Saint Mary's University; University of Prince Edward Island","funders":"","keywords":"Closure (psychology); Constraint (computer-aided design); Upper and lower bounds; State (computer science); Coding (social sciences); Regular language; Computer science; Set (abstract data type); Theoretical computer science; Mathematics; Discrete mathematics; Algorithm; Automaton; Programming language","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.0002872706,0.00005399054,0.00008502962,0.00008272071,0.0001372692,0.00003446855,0.0007972465,0.00001557397,0.000003449634],"category_scores_gemma":[0.00004449761,0.00003406511,0.00005411919,0.0002299237,0.0005253106,0.00002742708,0.0001801688,0.00005280412,7.024707e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001947853,"about_ca_system_score_gemma":0.0002517972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005917233,"about_ca_topic_score_gemma":0.00000934287,"domain_scores_codex":[0.999126,0.00002709144,0.0002933085,0.0001129407,0.0003659438,0.00007475135],"domain_scores_gemma":[0.9983287,0.00001981256,0.0002941769,0.0001393926,0.001177355,0.00004053323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001648294,0.0003063009,0.04621646,0.000008639641,0.0001165708,0.000002792782,0.0003898271,0.02919726,0.8942733,0.009313907,0.0002428197,0.01976731],"study_design_scores_gemma":[0.0009531896,0.001217016,0.4022348,0.0001243147,0.00001794174,0.0004611239,0.00004750199,0.004489401,0.5824224,0.001479681,0.006315197,0.0002374296],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6330364,0.000006970018,0.3661855,0.0004798818,0.0001467696,0.00006280395,0.000004076611,0.00000114932,0.00007638837],"genre_scores_gemma":[0.9646301,0.000009311423,0.035074,0.0001324845,0.0001353051,0.00000132501,0.000003555784,0.000001964161,0.00001189341],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3560183,"threshold_uncertainty_score":0.1935529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03906646804155322,"score_gpt":0.3068749110862771,"score_spread":0.2678084430447239,"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."}}