{"id":"W1583687157","doi":"10.1007/3-540-45452-7_23","title":"Constructing NFAs by Optimal Use of Positions in Regular Expressions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Regular expression; Nondeterministic finite automaton; Computer science; Automaton; Quotient; Nondeterministic algorithm; Expression (computer science); Finite-state machine; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; 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.001314398,0.0009671255,0.001446619,0.001126367,0.001319587,0.002615651,0.001996526,0.001372109,0.005113952],"category_scores_gemma":[0.006329297,0.001401944,0.002101051,0.001467557,0.002324515,0.006640619,0.003095341,0.002376934,0.002023622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009092856,"about_ca_system_score_gemma":0.001018889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001159798,"about_ca_topic_score_gemma":0.002126547,"domain_scores_codex":[0.9983515,0.0003950092,0.0001702971,0.0003986293,0.0003613463,0.0003233116],"domain_scores_gemma":[0.9961939,0.002050196,0.0001771106,0.001160229,0.0002940636,0.0001245742],"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.0006043198,0.0003405884,0.003242465,0.0006935016,0.00009901429,0.0006425988,0.002008457,0.02721324,0.04831478,0.5136241,0.004341844,0.398875],"study_design_scores_gemma":[0.0001527097,0.0001906879,0.0005360601,0.0001629746,0.0002762098,0.0005747511,0.0008195852,0.1152773,0.06458171,0.7926239,0.02468273,0.0001213849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1016439,0.0002096102,0.8819464,0.0002742544,0.0001219213,0.0001472803,0.000203123,0.004936777,0.01051674],"genre_scores_gemma":[0.3736605,0.0003117919,0.61775,0.0001065834,0.00004965625,0.0001715218,0.0004530026,0.001361824,0.006135107],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005113952,"threshold_uncertainty_score":0.0171079,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01848285626588725,"score_gpt":0.2280225686282943,"score_spread":0.2095397123624071,"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."}}