{"id":"W2099119688","doi":"10.1007/978-3-319-09698-8_4","title":"State Complexity of Deletion","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Regular language; Upper and lower bounds; State (computer science); Finite-state machine; Computer science; Deterministic finite automaton; Automaton; Matching (statistics); Time complexity; Computational complexity theory; Combinatorics; Discrete mathematics; Algorithm; Theoretical computer science; Mathematics","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.0009627513,0.0004987576,0.000968535,0.001311823,0.001564848,0.004922195,0.001645162,0.001388859,0.01600962],"category_scores_gemma":[0.007867627,0.0005888554,0.001191065,0.002024659,0.002565097,0.008822193,0.002644541,0.003910789,0.00141046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002522138,"about_ca_system_score_gemma":0.001424766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001539928,"about_ca_topic_score_gemma":0.001158548,"domain_scores_codex":[0.9981372,0.0003346561,0.0001019585,0.0003561623,0.0007500621,0.000319905],"domain_scores_gemma":[0.9920765,0.005502922,0.0003848187,0.001028146,0.000666927,0.0003406584],"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.0000799939,0.00002570874,0.0003852266,0.00005888286,0.000008982979,0.00004410488,0.000260586,0.006634179,0.0007934475,0.9787385,0.002324252,0.0106462],"study_design_scores_gemma":[0.00001090897,0.000009119176,0.0002918091,0.0000113712,0.00001181459,0.00005714556,0.00005929416,0.01629067,0.0008123812,0.9801152,0.002318615,0.0000117203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4820071,0.001887372,0.1991592,0.00622883,0.0003257436,0.0001138841,0.002261158,0.0007476817,0.3072691],"genre_scores_gemma":[0.9664883,0.0006597388,0.00832323,0.0001696951,0.0001963263,0.0001003933,0.0009422295,0.000197546,0.02292258],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01600962,"threshold_uncertainty_score":0.05355752,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02251538092527736,"score_gpt":0.2397213182243491,"score_spread":0.2172059372990718,"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."}}