{"id":"W1966076725","doi":"10.4204/eptcs.31.21","title":"Nondeterministic State Complexity for Suffix-Free Regular Languages","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Catenation; Regular language; Suffix; Upper and lower bounds; Discrete mathematics; Computer science; State (computer science); String (physics); Intersection (aeronautics); Automaton; Mathematics; Theoretical computer science; Algorithm; Automata theory","routes":{"ca_aff":true,"ca_fund":true,"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","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003216656,0.0002926164,0.0003265916,0.000319958,0.0003814079,0.0007035984,0.005577061,0.00008983253,0.00001969063],"category_scores_gemma":[0.0005425535,0.0002560073,0.00009209058,0.001220907,0.002719294,0.0009312659,0.001373998,0.000655103,0.00001304551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001311686,"about_ca_system_score_gemma":0.0003239345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004171263,"about_ca_topic_score_gemma":0.000009775415,"domain_scores_codex":[0.996326,0.00002125359,0.0004003629,0.001116929,0.0006230579,0.001512385],"domain_scores_gemma":[0.9982553,0.0003084487,0.0001304421,0.0008143393,0.0002497796,0.0002417557],"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.00001620014,0.00007612072,0.00007172394,0.00002141585,0.000003318758,0.000005051446,0.0004205849,0.00000281308,0.008724066,0.9739639,0.00008712539,0.01660766],"study_design_scores_gemma":[0.0004496342,0.0003072535,0.000524415,0.0000214062,0.000002842514,0.00007450857,0.00001151987,0.2868819,0.01454032,0.6966116,0.0002968615,0.0002777646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.374899,0.00004127393,0.6203756,0.001442882,0.0004974168,0.0004896202,0.000005290987,0.0003829516,0.001865942],"genre_scores_gemma":[0.8810781,0.000003643908,0.1182159,0.0004606725,0.0001563805,0.000047991,0.000001029203,0.00001699678,0.00001931198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5061791,"threshold_uncertainty_score":0.9999948,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006249754356745859,"score_gpt":0.2532547907464555,"score_spread":0.2470050363897097,"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."}}