{"id":"W1571429055","doi":"10.1007/978-3-540-73208-2_22","title":"State Complexity of Union and Intersection of Finite Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Intersection (aeronautics); Alphabet; Finite-state machine; Regular language; Upper and lower bounds; Deterministic finite automaton; Automaton; State (computer science); Mathematics; Nondeterministic finite automaton; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","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.002597409,0.0005703116,0.001628359,0.002004953,0.002435721,0.01025384,0.002731212,0.002122679,0.01140567],"category_scores_gemma":[0.02301528,0.001264771,0.00208107,0.002957758,0.004649221,0.02111611,0.003632861,0.005658312,0.0006503022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00431187,"about_ca_system_score_gemma":0.002539665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003562645,"about_ca_topic_score_gemma":0.002899899,"domain_scores_codex":[0.9961314,0.0008860928,0.0002558058,0.0006677388,0.001435234,0.0006237314],"domain_scores_gemma":[0.9529844,0.03993432,0.001590575,0.002611148,0.001605972,0.001273483],"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.0003297972,0.00009237944,0.002382375,0.0001204711,0.00004037911,0.00009596309,0.0009806431,0.02709273,0.001510504,0.9525838,0.002084138,0.01268682],"study_design_scores_gemma":[0.00002333164,0.00001911872,0.00078539,0.00001455971,0.00002625449,0.00006590716,0.0001474661,0.09440851,0.001322983,0.9024247,0.000734986,0.00002663761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7577622,0.001173387,0.1872601,0.00346378,0.000101452,0.00009751771,0.001771713,0.000615312,0.04775443],"genre_scores_gemma":[0.9818524,0.000359126,0.01101495,0.00008533962,0.0001404974,0.0001061971,0.0008299336,0.000154145,0.005457346],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01140567,"threshold_uncertainty_score":0.03815579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02657055417739969,"score_gpt":0.2664467808379508,"score_spread":0.2398762266605511,"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."}}