{"id":"W4379614944","doi":"10.1016/j.tcs.2023.113999","title":"The nondeterministic state complexity of the site-directed deletion language operation","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Nondeterministic algorithm; Upper and lower bounds; Deterministic finite automaton; String (physics); Combinatorics; Nondeterministic finite automaton; Finite-state machine; Mathematics; Regular language; Prefix; Discrete mathematics; Computer science; Automaton; Algorithm; Data structure; Theoretical computer science; Automata theory; 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008157865,0.00007472815,0.00007119767,0.00001629048,0.0004321898,0.00006410355,0.000506478,0.00003098593,0.000005385904],"category_scores_gemma":[0.0001903129,0.00003681251,0.0000471087,0.0003325955,0.002735946,0.000002579226,0.0005670692,0.00007020466,0.00001427706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006909464,"about_ca_system_score_gemma":0.00003798424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004402233,"about_ca_topic_score_gemma":0.000005723835,"domain_scores_codex":[0.9990418,0.0001393577,0.0001517036,0.0002360409,0.0001986518,0.0002324605],"domain_scores_gemma":[0.9994325,0.00007978784,0.0000487299,0.0003092173,0.0000866708,0.00004310122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005759552,0.00003568044,0.0007994429,0.000009458188,0.000007886626,0.000002523874,0.0002293688,0.0005662663,0.8637069,0.1063818,0.0002258494,0.0279772],"study_design_scores_gemma":[0.0003465012,0.0006347636,0.07466765,0.00003016583,0.00001060354,0.00001839601,0.00004441769,0.5090282,0.395178,0.01901057,0.0007472508,0.0002834058],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9825017,0.00001534914,0.01627713,0.000357597,0.0002194167,0.000115739,0.00000598783,0.00003760764,0.0004694599],"genre_scores_gemma":[0.9988236,0.000005607863,0.0008658156,0.0001794383,0.00007864545,0.000002303104,0.000009287616,0.000003395934,0.00003186545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.508462,"threshold_uncertainty_score":0.9999781,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01463780343291903,"score_gpt":0.2707185309608592,"score_spread":0.2560807275279401,"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."}}