{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003390715,0.0008194502,0.001676488,0.001781445,0.001947361,0.00523097,0.003007132,0.002475805,0.005328047],"category_scores_gemma":[0.0296207,0.001054794,0.001469446,0.00227882,0.005090517,0.01363766,0.00348749,0.005719447,0.0005397316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003698106,"about_ca_system_score_gemma":0.001375514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003205558,"about_ca_topic_score_gemma":0.00155013,"domain_scores_codex":[0.9963723,0.001281843,0.0002446032,0.0004086158,0.001282732,0.0004098205],"domain_scores_gemma":[0.9662905,0.02835301,0.001134237,0.002306516,0.001359429,0.0005562892],"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.00003972096,0.00002661929,0.0003543033,0.00007127001,0.00001537049,0.00005614448,0.0001748629,0.02691694,0.0003152889,0.9660922,0.001120204,0.004817087],"study_design_scores_gemma":[0.000006029672,0.000004578688,0.00009054307,0.00001136831,0.000004708344,0.0000221992,0.00003050263,0.0560027,0.000132749,0.9431762,0.00050725,0.00001121178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4241968,0.007214922,0.4395399,0.0197075,0.0005399899,0.0001515286,0.001269859,0.0004749602,0.1069045],"genre_scores_gemma":[0.9696733,0.00184416,0.02190573,0.0004471378,0.0004057573,0.0001491224,0.0005397795,0.0001455038,0.004889462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005328047,"threshold_uncertainty_score":0.02683181,"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."}}