{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562088,0.0006682443,0.001164109,0.001411492,0.001411455,0.004649658,0.001748964,0.00123295,0.005303057],"category_scores_gemma":[0.02020306,0.0006134555,0.00182111,0.001264621,0.003224393,0.008742652,0.002287368,0.002848998,0.0004678598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003052801,"about_ca_system_score_gemma":0.002193436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001600211,"about_ca_topic_score_gemma":0.00163282,"domain_scores_codex":[0.9956975,0.0008333136,0.0004350653,0.0008661884,0.001418921,0.0007491369],"domain_scores_gemma":[0.9515318,0.03925262,0.002920142,0.003523391,0.00171981,0.001052135],"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.001232188,0.0004315778,0.008893254,0.0004625207,0.0001338614,0.0005094701,0.001575016,0.3351859,0.03564902,0.5785578,0.00188181,0.03548757],"study_design_scores_gemma":[0.00005593357,0.0001349667,0.001188886,0.00001489625,0.00005424878,0.0001630173,0.0001197507,0.5651072,0.01260417,0.4195549,0.0009391548,0.00006279049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7891127,0.0004011648,0.1986765,0.001016728,0.00004139311,0.0001631072,0.0007899329,0.00057289,0.009225572],"genre_scores_gemma":[0.9677414,0.0002044138,0.02927778,0.00006546247,0.0000551212,0.00017404,0.0005864922,0.0001226409,0.001772614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005303057,"threshold_uncertainty_score":0.02214974,"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."}}