{"id":"W2002992445","doi":"10.1016/s0304-3975(02)00830-7","title":"On the complexity of intersecting finite state automata and NL versus NP","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Mathematics; Complexity class; Deterministic finite automaton; DFA minimization; Intersection (aeronautics); Finite-state machine; Class (philosophy); Time complexity; Computational complexity theory; Discrete mathematics; Combinatorics; Algorithm; State (computer science); Automaton; Quantum finite automata; Automata theory; Computer science; Theoretical computer science","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002642879,0.0001695605,0.0001953615,0.0001149375,0.0003900608,0.0002931934,0.001789661,0.00002696381,0.0000369697],"category_scores_gemma":[0.0005321819,0.0001092777,0.00004948242,0.0007433394,0.006013618,0.0003378205,0.0008279098,0.0002075491,0.00002189781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002824973,"about_ca_system_score_gemma":0.00006222613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004150019,"about_ca_topic_score_gemma":6.989546e-7,"domain_scores_codex":[0.9979801,0.0002771975,0.0002623037,0.0005348028,0.000514342,0.0004312997],"domain_scores_gemma":[0.9967025,0.00205304,0.0001045984,0.0009057074,0.00009089861,0.0001432535],"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.00001681111,0.00003683017,0.000007539889,0.00000517451,0.000004779614,0.000005794238,0.0007015432,0.00008295719,0.0001724503,0.9905265,0.00002501723,0.008414629],"study_design_scores_gemma":[0.0003049906,0.0002920545,0.0001854897,0.00003081809,0.000002401793,0.0000240954,0.00002538639,0.4099224,0.00474859,0.5842999,0.00003453628,0.0001293915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2702046,0.00001398359,0.7234456,0.0009070452,0.0005843398,0.0001178797,0.000002391792,0.0001239591,0.004600172],"genre_scores_gemma":[0.9646446,0.00000282783,0.03474523,0.000579506,0.00001586408,0.000002598448,1.655699e-7,0.000005787923,0.000003457808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6944399,"threshold_uncertainty_score":0.9966915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03585890837325412,"score_gpt":0.2605987869236125,"score_spread":0.2247398785503584,"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."}}