{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551547,0.0007650506,0.001722047,0.001663675,0.001608499,0.004925324,0.001968112,0.001658924,0.006261417],"category_scores_gemma":[0.02277024,0.0004953728,0.002301587,0.002216196,0.004563964,0.01054209,0.004350019,0.004809846,0.0005772501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003273416,"about_ca_system_score_gemma":0.002458425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002606235,"about_ca_topic_score_gemma":0.001607245,"domain_scores_codex":[0.995365,0.0008568745,0.0003752667,0.001123015,0.001369445,0.000910298],"domain_scores_gemma":[0.9616092,0.03092383,0.001657406,0.00290273,0.001809248,0.001097552],"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.0003668579,0.0001210901,0.001333112,0.00021218,0.00003110477,0.0002041983,0.0007209902,0.05943307,0.00642509,0.9071144,0.001931627,0.02210619],"study_design_scores_gemma":[0.00001863618,0.00004363116,0.0002192964,0.00001966686,0.00001511142,0.0000799899,0.00007478631,0.144574,0.003070322,0.8507325,0.001113937,0.00003815695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4119304,0.001549417,0.5564565,0.003869977,0.0002105258,0.0001819294,0.001495039,0.0008631783,0.023443],"genre_scores_gemma":[0.9171374,0.0009118638,0.07420263,0.0003618962,0.0003069048,0.0003793056,0.001037372,0.0003538431,0.005308894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006261417,"threshold_uncertainty_score":0.02375036,"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."}}