{"id":"W2074221742","doi":"10.1142/s0129054108005838","title":"STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Finite-state machine; Deterministic finite automaton; Alphabet; Intersection (aeronautics); Regular language; Nondeterministic finite automaton; Mathematics; Upper and lower bounds; Automaton; State (computer science); Discrete mathematics; Finite state; Quantum finite automata; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm","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.00334302,0.0006863284,0.001859343,0.001953779,0.002374834,0.008321833,0.003299003,0.001828953,0.008323002],"category_scores_gemma":[0.03480097,0.001047799,0.002351647,0.002752813,0.004277855,0.01943999,0.004625292,0.004233334,0.0005032936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005017387,"about_ca_system_score_gemma":0.003073303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004215403,"about_ca_topic_score_gemma":0.003322111,"domain_scores_codex":[0.992782,0.001442467,0.000651435,0.001523549,0.002177737,0.001422881],"domain_scores_gemma":[0.924574,0.06247458,0.003975939,0.00485176,0.002640398,0.001483446],"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.001977541,0.000482972,0.01298316,0.0006730125,0.0001874259,0.0003299548,0.002375179,0.2792881,0.01198568,0.630232,0.003727709,0.05575735],"study_design_scores_gemma":[0.00004450223,0.00009671303,0.00139266,0.00003560416,0.00006656175,0.0001221475,0.0002264114,0.5385932,0.01085973,0.4474168,0.001074271,0.0000715556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7953647,0.0006299017,0.1871463,0.001960556,0.00006635665,0.0001560672,0.001660471,0.001011364,0.0120042],"genre_scores_gemma":[0.9712154,0.0002268556,0.02506663,0.00008116447,0.00007483143,0.0001360405,0.001035376,0.0001906904,0.001973136],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008323002,"threshold_uncertainty_score":0.03640383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02956932046349621,"score_gpt":0.2988042262286668,"score_spread":0.2692349057651706,"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."}}