{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001113322,0.0003473643,0.0003854781,0.0002079525,0.0002601249,0.0003371741,0.002665652,0.0001663613,0.00002019877],"category_scores_gemma":[0.0001107836,0.0002469966,0.00007750846,0.0003659822,0.001407868,0.0005291244,0.001251398,0.0004328116,0.000001937653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008338414,"about_ca_system_score_gemma":0.0002526629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005952733,"about_ca_topic_score_gemma":0.00001048396,"domain_scores_codex":[0.9974455,0.00004556304,0.0004271093,0.0009638706,0.0006731095,0.0004448315],"domain_scores_gemma":[0.9973937,0.001120616,0.0003405195,0.0009672115,0.00009456411,0.00008338137],"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.000003445463,0.0000170464,0.00003129309,0.00004825321,0.00001386259,0.00000831775,0.001814524,0.01365711,0.002796779,0.01180478,0.00003635692,0.9697682],"study_design_scores_gemma":[0.0002141748,0.0001378404,0.00006213281,0.0007904585,0.00001711817,0.0001151253,0.000001824255,0.8700284,0.00647536,0.1205451,0.0009902836,0.000622232],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003594988,0.003252254,0.9902163,0.0008401325,0.000644467,0.0002444427,0.000005000755,0.00006709957,0.001135304],"genre_scores_gemma":[0.7035286,0.0002524368,0.2942648,0.001285138,0.0003596546,0.000003265077,8.791953e-7,0.00003034536,0.0002748472],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.969146,"threshold_uncertainty_score":0.9999982,"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."}}