{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004216593,0.00006758806,0.0001130528,0.00006624642,0.00003747808,0.0000607808,0.0002616176,0.00002602402,0.000005219235],"category_scores_gemma":[0.00005386757,0.00005688185,0.00001771155,0.0001328326,0.00009207311,0.001050842,0.0001654121,0.00005416373,0.00002624263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001612803,"about_ca_system_score_gemma":0.00003186457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002733623,"about_ca_topic_score_gemma":0.000002316469,"domain_scores_codex":[0.9993509,0.00002804726,0.0002405828,0.00006754003,0.0001851027,0.0001278173],"domain_scores_gemma":[0.9994232,0.00003813763,0.0001199843,0.0002559233,0.00007677392,0.00008598984],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004970587,0.0001458043,0.001922903,0.0003056402,0.00006015652,0.000004290333,0.02334799,0.00008632259,0.002498644,0.5699022,0.007910532,0.3937659],"study_design_scores_gemma":[0.001141591,0.0003898352,0.01204714,0.00008013201,0.00001265611,0.00008348327,0.0005015793,0.7887721,0.007621734,0.1470546,0.04190551,0.0003896618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7561382,0.000107307,0.2404097,0.0006105981,0.0001098577,0.0001272677,0.000006818826,0.0001225879,0.002367722],"genre_scores_gemma":[0.974381,0.00002190353,0.02533279,0.0002348166,0.000007795197,0.000002303865,0.000005838792,0.000002433434,0.00001111979],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7886857,"threshold_uncertainty_score":0.2319575,"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."}}