{"id":"W2077823020","doi":"10.1007/s11047-013-9364-y","title":"Computing maximal Kleene closures that are embeddable in a given subword-closed language","year":2013,"lang":"en","type":"article","venue":"Natural Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Closure (psychology); Regular language; Computer science; Set (abstract data type); Property (philosophy); Characterization (materials science); Discrete mathematics; Coding (social sciences); DNA computing; Mathematics; Algorithm; Theoretical computer science; Automaton; Programming language","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.0003745962,0.0002991724,0.0003364615,0.00008162487,0.000183547,0.0001167637,0.000415421,0.0002478863,0.00002857989],"category_scores_gemma":[0.0001823017,0.000243789,0.0001503227,0.0002332626,0.00007124925,0.0000115364,0.0005411,0.0004663407,0.00003537496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003567322,"about_ca_system_score_gemma":0.00003306063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002482296,"about_ca_topic_score_gemma":0.0000745109,"domain_scores_codex":[0.9979687,0.0001743068,0.0003604978,0.0006051566,0.0002003584,0.0006909554],"domain_scores_gemma":[0.9992293,0.00009167317,0.0002163599,0.0002684135,0.0000957123,0.00009859849],"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.0001076215,0.0001751234,0.3054289,0.0001035667,0.000088069,0.0000962305,0.0004501266,0.001485402,0.593735,0.00008702742,0.002214409,0.09602851],"study_design_scores_gemma":[0.00252634,0.0004624712,0.8155857,0.000375595,0.00002235866,0.0001116092,0.001971338,0.06534126,0.1097291,0.0002959682,0.002126277,0.001452005],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9954968,0.001997739,0.0004885935,0.0003122522,0.0003324781,0.0003110013,0.00000303954,0.00008252472,0.0009755387],"genre_scores_gemma":[0.9944284,0.000007699237,0.004048761,0.0006398392,0.0005808374,0.000002735056,0.00008355664,0.00002609345,0.0001820798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5101568,"threshold_uncertainty_score":0.9941426,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01113627193867799,"score_gpt":0.2531903348998224,"score_spread":0.2420540629611444,"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."}}