{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001658026,0.0008514296,0.001613203,0.00139831,0.002182351,0.00788627,0.003407456,0.003007284,0.00919405],"category_scores_gemma":[0.02037656,0.001438209,0.002021064,0.002622133,0.005028283,0.01939662,0.003381059,0.005744865,0.0008580302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002990623,"about_ca_system_score_gemma":0.001546036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001916574,"about_ca_topic_score_gemma":0.001483677,"domain_scores_codex":[0.9965437,0.0009089069,0.000263426,0.0006614142,0.001156091,0.0004664316],"domain_scores_gemma":[0.9625654,0.03166277,0.001583116,0.002307684,0.0009026128,0.000978387],"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.0003396762,0.0001029816,0.002143793,0.0002761461,0.0000612472,0.0002514286,0.0009136896,0.04127676,0.001915321,0.9319173,0.003365843,0.0174358],"study_design_scores_gemma":[0.00002319106,0.00001433036,0.0003126085,0.00001354506,0.00001584023,0.00009365894,0.00008956503,0.02876768,0.0004208955,0.9693956,0.0008341798,0.00001883484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7233971,0.004119705,0.1605051,0.008072547,0.0003019966,0.0001030666,0.002279409,0.0006260911,0.1005951],"genre_scores_gemma":[0.967747,0.001192921,0.0197727,0.0002673921,0.000459157,0.0001382779,0.001172094,0.0002131047,0.009037445],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00919405,"threshold_uncertainty_score":0.03075713,"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."}}