{"id":"W2002626286","doi":"10.1016/j.ic.2012.04.003","title":"Deciding regularity of hairpin completions of regular languages in polynomial time","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Decidability; Regular language; DNA computing; Topological entropy; Formal language; Time complexity; Mathematics; Context (archaeology); Discrete mathematics; Exponential function; Computer science; Exponential growth; Growth function; Combinatorics; Algorithm; Theoretical computer science; Automaton","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.0001938763,0.00004140776,0.0000757649,0.00004830617,0.00002118661,0.000005532591,0.00003158547,0.00005258096,0.000003375387],"category_scores_gemma":[0.00004365639,0.00003739642,0.00002094638,0.00005962922,0.0000324683,0.00001869935,0.00003610971,0.00002445926,0.000001698797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004074879,"about_ca_system_score_gemma":0.000007433235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001648827,"about_ca_topic_score_gemma":0.000001621403,"domain_scores_codex":[0.9995999,0.0000316867,0.000213217,0.00003662603,0.00004884334,0.00006973417],"domain_scores_gemma":[0.9997715,0.00001337568,0.000111252,0.0000412666,0.00004228102,0.00002031134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0002208102,0.0002149987,0.1068096,0.0001863593,0.00004685176,2.264666e-7,0.001744572,0.003660813,0.6913105,0.003002501,0.001448433,0.1913543],"study_design_scores_gemma":[0.0015805,0.000376397,0.8052108,0.00008413917,0.00001622181,0.00001937345,0.0009264748,0.0239882,0.1611531,0.0002671687,0.006087317,0.0002902223],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9872681,0.0001188798,0.01169582,0.00003555947,0.00002345832,0.00006233527,0.000005596132,0.000004608996,0.0007855997],"genre_scores_gemma":[0.9975954,0.000006727738,0.002165992,0.00004359961,0.00002706745,0.00000101967,0.0001512353,0.000001216843,0.00000770548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6984013,"threshold_uncertainty_score":0.1524982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009762622650934222,"score_gpt":0.2620396691484025,"score_spread":0.2522770464974683,"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."}}