{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002476137,0.0009375169,0.001927581,0.0007910312,0.001570456,0.00486011,0.002296679,0.001671131,0.009640984],"category_scores_gemma":[0.01625806,0.001397395,0.002709102,0.0009561449,0.003347436,0.009457078,0.003784386,0.005013295,0.001256497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001807539,"about_ca_system_score_gemma":0.002485236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002423573,"about_ca_topic_score_gemma":0.004453948,"domain_scores_codex":[0.9962728,0.0006719836,0.0002865116,0.001227758,0.0008094636,0.0007314578],"domain_scores_gemma":[0.9676622,0.02564676,0.001507236,0.002316553,0.001253003,0.001614354],"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.00843161,0.001901373,0.02422865,0.002073752,0.0005812201,0.001361585,0.003608251,0.1539936,0.07109416,0.5507744,0.03278115,0.1491702],"study_design_scores_gemma":[0.0006252989,0.0003994066,0.001766945,0.00005962028,0.0001362397,0.0002746164,0.0009095188,0.1562594,0.01951554,0.8161401,0.003808881,0.0001043284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7429628,0.0003887455,0.2307105,0.003943061,0.0001990062,0.0004912943,0.003073955,0.004854095,0.01337656],"genre_scores_gemma":[0.9198897,0.0001493795,0.07115759,0.0005694621,0.0001908191,0.0001431983,0.00375849,0.0006157242,0.003525557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009640984,"threshold_uncertainty_score":0.03225231,"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."}}