{"id":"W2177646325","doi":"10.1007/978-3-642-30642-6_4","title":"The Complexity of Intersecting Finite Automata Having Few Final States","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Intersection (aeronautics); Automaton; Commutative property; Quantum finite automata; Computer science; Limiting; Finite-state machine; Deterministic finite automaton; Transformation (genetics); DFA minimization; Computational complexity theory; Discrete mathematics; ω-automaton; Automata theory; Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Pure 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00229606,0.0004881231,0.0005370746,0.0004093788,0.0005748472,0.0005914972,0.004921508,0.0001891174,0.00002041292],"category_scores_gemma":[0.0001913833,0.0003567253,0.0001763161,0.0004845849,0.002442451,0.0007063379,0.002812053,0.0008323256,0.00002588694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001849685,"about_ca_system_score_gemma":0.0002761579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006213517,"about_ca_topic_score_gemma":0.00009730835,"domain_scores_codex":[0.9964904,0.00008166744,0.0007218699,0.0009564483,0.0009031224,0.000846501],"domain_scores_gemma":[0.9952023,0.002114837,0.0006054412,0.001725532,0.0002061905,0.0001456683],"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.000008015423,0.00003166268,0.0001189551,0.00006099295,0.00001940801,0.00002062899,0.002004245,0.005243225,0.0001136852,0.1026549,0.000022482,0.8897018],"study_design_scores_gemma":[0.0001775544,0.0001038663,0.0003544914,0.0005488151,0.000008709108,0.00005872617,0.000001627086,0.6303831,0.001232397,0.3658252,0.0008566235,0.0004489664],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006181806,0.001220981,0.9940909,0.0007452113,0.001831868,0.0002489234,0.00001065026,0.0001966608,0.00103662],"genre_scores_gemma":[0.7831873,0.000145352,0.2152996,0.0007036917,0.0004473516,0.00000747878,0.000008081651,0.00004388318,0.0001572596],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8892528,"threshold_uncertainty_score":0.9998885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04821360167386302,"score_gpt":0.2649948956859152,"score_spread":0.2167812940120522,"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."}}