{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002288093,0.0004287872,0.0009420983,0.0007382333,0.001507934,0.004879822,0.001763885,0.001588945,0.007925301],"category_scores_gemma":[0.01711159,0.0006256904,0.001312927,0.0009161343,0.003907812,0.01032716,0.002144637,0.004010488,0.000756788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002316501,"about_ca_system_score_gemma":0.002592995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002177897,"about_ca_topic_score_gemma":0.001385694,"domain_scores_codex":[0.9971526,0.0007311325,0.0001834411,0.0005489927,0.0009382463,0.0004456423],"domain_scores_gemma":[0.9749994,0.02102726,0.0007165328,0.001898278,0.00096994,0.0003886517],"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.0001236942,0.00004110568,0.0005239029,0.00006196457,0.00001253552,0.0001024764,0.0002470562,0.02174184,0.001794745,0.9677333,0.001018266,0.006599165],"study_design_scores_gemma":[0.00001734949,0.00001230092,0.000167998,0.000007556841,0.00001058455,0.00005586797,0.00003018079,0.07348702,0.001646956,0.9237992,0.0007466238,0.00001831256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4228301,0.0005625396,0.5088347,0.008629445,0.0002214919,0.0001224933,0.001126174,0.0008362223,0.05683684],"genre_scores_gemma":[0.9725631,0.0002206309,0.02037567,0.0002752135,0.0001493174,0.0001090142,0.0002989774,0.0001621038,0.005845966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007925301,"threshold_uncertainty_score":0.0265128,"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."}}