{"id":"W2079582928","doi":"10.1016/j.tcs.2009.05.001","title":"On the descriptional complexity of Watson–Crick automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Watson; Automaton; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Unary operation; Automata theory; Mathematics; Finite-state machine; Regular language; DFA minimization; Deterministic finite automaton; Discrete mathematics; Quantum finite automata; Combinatorics; Computer science; Theoretical computer science; Algorithm; DNA; Base pair","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007242225,0.00009789112,0.00009975793,0.00002343562,0.0002031421,0.00003857105,0.0007442554,0.00004391405,0.00003871595],"category_scores_gemma":[0.0001462248,0.0000533985,0.00006071259,0.0001942218,0.002916356,0.000003344399,0.0002471125,0.00008961764,0.00001152674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007578642,"about_ca_system_score_gemma":0.00003210968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.714228e-7,"about_ca_topic_score_gemma":9.66438e-8,"domain_scores_codex":[0.998951,0.00007920287,0.0001513962,0.0003081533,0.000261055,0.000249196],"domain_scores_gemma":[0.9993914,0.00006228092,0.00004247142,0.0003403412,0.0000904629,0.00007303054],"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.00003770331,0.00007257115,0.00003064046,9.880837e-7,0.00000208161,6.301248e-7,0.00001106823,0.00004136519,0.07557944,0.9179843,0.0001792217,0.006059963],"study_design_scores_gemma":[0.000370516,0.003986237,0.02937521,0.00003590858,0.000007289793,0.00003075115,0.00001006855,0.06441842,0.1679645,0.7330109,0.0004759807,0.0003141979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8958036,0.00001374983,0.09746826,0.001737234,0.0001164755,0.0000863324,0.000003140769,0.00001946182,0.004751779],"genre_scores_gemma":[0.9909761,0.000001954948,0.007034542,0.001861669,0.000113027,7.154006e-7,0.000004076319,0.000002052896,0.000005868783],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1849734,"threshold_uncertainty_score":0.9997971,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03009187934474768,"score_gpt":0.2660095653318389,"score_spread":0.2359176859870912,"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."}}