{"id":"W1532642937","doi":"10.1016/j.tcs.2009.07.049","title":"On NFAs where all states are final, initial, or both","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Finite-state machine; Regular language; Computer science; Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Programming language; Automata theory","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.003295212,0.001261635,0.001757113,0.002351476,0.003314955,0.005201442,0.001772002,0.002981522,0.0085806],"category_scores_gemma":[0.01357232,0.000957538,0.002665544,0.002248773,0.006056928,0.01758866,0.004245065,0.002806266,0.001703704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002485845,"about_ca_system_score_gemma":0.001681677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003546114,"about_ca_topic_score_gemma":0.004285273,"domain_scores_codex":[0.9951041,0.001224244,0.0004150013,0.001130644,0.001200766,0.0009253843],"domain_scores_gemma":[0.9817472,0.01155669,0.001391983,0.00331906,0.001269526,0.0007155656],"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.0002079111,0.00008402253,0.00106289,0.000189197,0.00005652659,0.0004342801,0.001212349,0.008211572,0.003915029,0.9629834,0.001558516,0.02008426],"study_design_scores_gemma":[0.00002849126,0.00003229889,0.0002134095,0.00008165649,0.00003728697,0.0002505009,0.0001675326,0.01310734,0.001119711,0.9815523,0.00337496,0.00003457943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2207468,0.001320485,0.7126623,0.00208565,0.0004879079,0.0002171331,0.001194321,0.002137071,0.0591483],"genre_scores_gemma":[0.8267475,0.001386816,0.1314875,0.0007610882,0.0006904766,0.0006073644,0.001587668,0.000729715,0.03600189],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0085806,"threshold_uncertainty_score":0.02870494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02479621673681167,"score_gpt":0.2909578726236236,"score_spread":0.266161655886812,"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."}}