{"id":"W1966644481","doi":"10.1007/s00236-007-0041-4","title":"The syntactic monoid of hairpin-free languages","year":2007,"lang":"en","type":"article","venue":"Acta Informatica","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"DNA computing; String (physics); Formal language; Computer science; Rewriting; DNA; Free monoid; Alphabet; Context (archaeology); Characterization (materials science); Mathematics; Discrete mathematics; Monoid; Physics; Algorithm; Biology; Genetics; Programming language; Linguistics; Theoretical physics","routes":{"ca_aff":true,"ca_fund":true,"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.0003902153,0.0000702813,0.00007410707,0.00001332298,0.000087312,0.00002201476,0.0003312432,0.0000711143,0.000006499844],"category_scores_gemma":[0.0004885424,0.00004014104,0.00005356673,0.00004912591,0.00007444649,0.00000540809,0.0001930024,0.00006229796,0.000008036785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003888457,"about_ca_system_score_gemma":0.00001445548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004649991,"about_ca_topic_score_gemma":0.000009550708,"domain_scores_codex":[0.9994165,0.00001257432,0.0002365465,0.00005990452,0.00008340685,0.0001910388],"domain_scores_gemma":[0.9994063,0.00008686449,0.0001016082,0.0003274016,0.00003959714,0.00003823362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004209355,0.000135932,0.006778725,0.0001656027,0.0002500089,0.000007329499,0.00061693,0.00001556131,0.8210523,0.007914195,0.01468362,0.1479589],"study_design_scores_gemma":[0.0008202824,0.0009348248,0.02954059,0.00004331961,0.00003262576,0.00004669889,0.003225516,0.0002863227,0.6382055,0.0005826581,0.3258724,0.0004092463],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9512791,0.0002044233,0.0008404809,0.0002501838,0.00006806241,0.00008897275,0.000002802419,0.0000123536,0.04725361],"genre_scores_gemma":[0.9986999,0.00004179183,0.0007821446,0.0002417375,0.00007027303,0.000001429682,0.00001133006,0.000003376809,0.0001480046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3111888,"threshold_uncertainty_score":0.1636904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005987572387986165,"score_gpt":0.2497809497333986,"score_spread":0.2437933773454125,"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."}}