{"id":"W796701085","doi":"10.1007/s00236-015-0245-y","title":"State complexity of deletion and bipolar deletion","year":2015,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Deterministic finite automaton; Theory of computation; Combinatorics; State (computer science); Regular language; Matching (statistics); Mathematics; Finite-state machine; Nondeterministic finite automaton; Discrete mathematics; Computational complexity theory; Time complexity; DFA minimization; Automaton; Automata theory; Algorithm; Computer science; Theoretical computer science","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.001977259,0.0005958198,0.0015188,0.001662653,0.001921115,0.006321935,0.001965208,0.001961641,0.01422142],"category_scores_gemma":[0.01759791,0.0007156732,0.001594695,0.00214022,0.003041251,0.01127794,0.003026035,0.003301933,0.0006751341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00233793,"about_ca_system_score_gemma":0.001601212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002770353,"about_ca_topic_score_gemma":0.001926469,"domain_scores_codex":[0.9978758,0.0005167701,0.0001443235,0.0003687062,0.0006331259,0.0004612889],"domain_scores_gemma":[0.9713109,0.02270707,0.001404317,0.001703921,0.001534575,0.001339325],"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.0003528649,0.00007381876,0.001685497,0.0001226009,0.00002847004,0.0001713396,0.0007024168,0.02518904,0.001495701,0.9591621,0.00164021,0.009376048],"study_design_scores_gemma":[0.00003854601,0.00002426064,0.0006424452,0.00001459906,0.00002636344,0.0001036311,0.0001655972,0.07766016,0.0008791466,0.9196923,0.0007262231,0.00002685054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7714636,0.0006367267,0.1854285,0.003255471,0.00009766201,0.000092326,0.001516311,0.0004066965,0.03710276],"genre_scores_gemma":[0.9850449,0.0002667556,0.007471853,0.0001149605,0.00008498486,0.00007568044,0.0007106831,0.00008701989,0.006143149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01422142,"threshold_uncertainty_score":0.04757541,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03540657342730158,"score_gpt":0.2394681679639424,"score_spread":0.2040615945366408,"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."}}