{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114435,0.0002397379,0.0003931999,0.0006823504,0.00005801634,0.00006716947,0.001066341,0.0001278989,0.000008708434],"category_scores_gemma":[0.00005004209,0.0002131205,0.00006416766,0.0003542627,0.001248047,0.0002901939,0.0007807875,0.0003073865,0.000001745345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006729241,"about_ca_system_score_gemma":0.0001016502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009627357,"about_ca_topic_score_gemma":0.0001202085,"domain_scores_codex":[0.9982393,0.00003625804,0.0004245696,0.0005925181,0.0004489251,0.000258466],"domain_scores_gemma":[0.9983473,0.0004476696,0.0003591003,0.0006294338,0.0001505741,0.00006592368],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001000191,0.00002657382,0.0001215909,0.0001165454,0.0000117757,0.00002177158,0.001857288,0.003127252,0.00116909,0.06968737,0.000002902883,0.9238479],"study_design_scores_gemma":[0.0003856226,0.0004400896,0.002274659,0.0009576502,0.000009400204,0.00006255296,0.000002389785,0.4135989,0.02654385,0.5550156,0.0001691169,0.000540246],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004428415,0.0003525436,0.9929156,0.00007838225,0.0004445852,0.0001383218,0.000009659735,0.00005319141,0.001579333],"genre_scores_gemma":[0.8408411,0.00003867477,0.1587854,0.0001850196,0.00006420926,6.706323e-7,0.00000324985,0.00001232484,0.00006943971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9233076,"threshold_uncertainty_score":0.8690802,"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."}}