{"id":"W1541666628","doi":"10.1007/11496656_27","title":"Reducing the Size of NFAs by Using Equivalences and Preorders","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Computer science; Regular expression; Matching (statistics); DFA minimization; Deterministic automaton; Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Automata theory; Programming language","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.00309088,0.001258291,0.002057751,0.001957982,0.001544771,0.004228894,0.003795141,0.001576344,0.01426864],"category_scores_gemma":[0.02439435,0.001479841,0.004524595,0.001888267,0.003049349,0.02191227,0.005120573,0.004149336,0.001944672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002711424,"about_ca_system_score_gemma":0.002607734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002350994,"about_ca_topic_score_gemma":0.004662851,"domain_scores_codex":[0.9938412,0.001741759,0.0005812213,0.000966788,0.002135701,0.0007333252],"domain_scores_gemma":[0.945669,0.0371008,0.001328118,0.01276184,0.002424985,0.0007153054],"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.001370945,0.0008259616,0.004074445,0.001480875,0.0002280404,0.0005314962,0.001340639,0.08442533,0.0468862,0.3266524,0.01550989,0.5166738],"study_design_scores_gemma":[0.000236569,0.0002428795,0.0008405365,0.0001837648,0.0002985401,0.0003784031,0.0004872794,0.1817395,0.02744343,0.76867,0.01937705,0.0001019481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1751485,0.001282756,0.7783728,0.003261353,0.0005588667,0.0004026337,0.0009492793,0.01141764,0.02860617],"genre_scores_gemma":[0.5267556,0.0009964926,0.4525891,0.0007637813,0.0004235428,0.0004638219,0.001769835,0.003596607,0.01264123],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01426864,"threshold_uncertainty_score":0.04773337,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01572826700469847,"score_gpt":0.2468300156282682,"score_spread":0.2311017486235697,"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."}}