{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000759491,0.00006534955,0.0001670236,0.0005483414,0.00006019081,0.00004395963,0.001192867,0.00001433692,0.000006849481],"category_scores_gemma":[0.00009083493,0.00005721477,0.00006228087,0.000389496,0.000925938,0.001184645,0.0002861537,0.00007319982,5.87059e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003771036,"about_ca_system_score_gemma":0.0001998617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004869755,"about_ca_topic_score_gemma":0.000004220898,"domain_scores_codex":[0.9986169,0.00005182485,0.0005151978,0.0001211452,0.0006135324,0.00008144152],"domain_scores_gemma":[0.9976434,0.0001773434,0.0007397911,0.0001797043,0.001213846,0.00004593921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00012893,0.001028714,0.01963766,0.00008302794,0.0003175061,0.00006559955,0.0170623,0.01650313,0.1021212,0.4194615,0.0003019028,0.4232885],"study_design_scores_gemma":[0.001822203,0.001200943,0.3501113,0.0005765039,0.00001918716,0.001440336,0.0002543434,0.4279215,0.1410374,0.07494493,0.0003540605,0.0003173801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4644504,0.00002732405,0.5347907,0.0002049069,0.0004133458,0.0000196772,0.000003615496,0.000004705409,0.00008536787],"genre_scores_gemma":[0.9039468,0.00003752909,0.09593567,0.00002925218,0.00004093069,2.029742e-7,7.84653e-7,0.00000180316,0.000007048338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4394964,"threshold_uncertainty_score":0.3411657,"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."}}