{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225235,0.0003006218,0.0003051617,0.0002116636,0.0004154941,0.0009111338,0.003555208,0.00007172767,0.00018592],"category_scores_gemma":[0.0001038455,0.0002068452,0.00008423516,0.001046009,0.001539664,0.0008560517,0.0006061164,0.0002889788,0.0002053931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006620587,"about_ca_system_score_gemma":0.0001347423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002467545,"about_ca_topic_score_gemma":0.000001000232,"domain_scores_codex":[0.9967992,0.0001460628,0.000329709,0.000973414,0.0008908691,0.0008606951],"domain_scores_gemma":[0.9976321,0.0005528256,0.0001157838,0.001200713,0.0001168404,0.0003816849],"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.00003526471,0.0001506566,0.000004600074,0.000005201363,0.000003295105,0.0001174252,0.0003559287,0.0002017338,0.0001299347,0.9420714,0.001756893,0.05516767],"study_design_scores_gemma":[0.0003595132,0.001242531,0.0007863917,0.0001220235,0.000004505187,0.00007946914,0.00001604649,0.3579614,0.002016847,0.6362441,0.0007775985,0.0003895806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07328153,0.00006987732,0.9152896,0.006695713,0.0006083801,0.0001989901,0.000004659149,0.0006027292,0.003248552],"genre_scores_gemma":[0.9365939,0.0000227073,0.05231048,0.01086484,0.0001513232,0.000004064803,0.000001168912,0.00000971442,0.00004175213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8633124,"threshold_uncertainty_score":0.8786083,"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."}}