{"id":"W2109036808","doi":"10.1016/j.tcs.2008.12.054","title":"State complexity of basic operations on suffix-free regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Catenation; Regular language; Suffix; Deterministic finite automaton; State (computer science); Abstract family of languages; Regular expression; Computer science; Nondeterministic finite automaton; Automaton; Cone (formal languages); Finite-state machine; Combined operations; Deterministic automaton; Pumping lemma for regular languages; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language; Automata theory; Second-generation programming language; Fifth-generation programming language; Linguistics","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.00125406,0.0001788263,0.0002454411,0.0001909158,0.0003032263,0.0002703997,0.003610773,0.00003391401,0.00003911123],"category_scores_gemma":[0.0001202123,0.0001403183,0.00007313582,0.0009440394,0.002787153,0.0005152381,0.0006524608,0.0001616464,0.00003857333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003704624,"about_ca_system_score_gemma":0.00009048989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006352477,"about_ca_topic_score_gemma":9.94709e-7,"domain_scores_codex":[0.9977987,0.0001364897,0.0003029054,0.0005939807,0.0007103673,0.000457595],"domain_scores_gemma":[0.99777,0.0001654905,0.00005684226,0.001652804,0.0001588242,0.0001961142],"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.000006756129,0.0001208656,0.000005212481,0.000003033605,0.000002225696,0.00001001633,0.000403608,0.0005681486,0.003175422,0.965611,0.00009160969,0.03000215],"study_design_scores_gemma":[0.0002494635,0.0005065933,0.003124386,0.00003727872,0.000002446332,0.00001700142,0.000009239863,0.3457735,0.03513508,0.6149406,0.00002258927,0.0001817355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2122439,0.00002920239,0.7808465,0.003126746,0.0001854811,0.0001389633,0.000007851463,0.0002186308,0.003202721],"genre_scores_gemma":[0.8748524,0.000003051465,0.1236912,0.001378042,0.00005364564,0.000001622272,0.000001176757,0.000004398963,0.00001443122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6626086,"threshold_uncertainty_score":0.9999267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01509453296345085,"score_gpt":0.2619686901403702,"score_spread":0.2468741571769193,"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."}}