{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00179733,0.0005340814,0.001456983,0.001210077,0.001447567,0.006524659,0.001957416,0.001666862,0.01002472],"category_scores_gemma":[0.01590323,0.000764378,0.001430165,0.001680075,0.002756045,0.01331641,0.002565832,0.002800237,0.0006607213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002353061,"about_ca_system_score_gemma":0.002054681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002193313,"about_ca_topic_score_gemma":0.002419237,"domain_scores_codex":[0.9974954,0.0004793327,0.0002154587,0.0004397656,0.0007694227,0.0006005297],"domain_scores_gemma":[0.9609974,0.0316106,0.001770742,0.002777135,0.001592235,0.001251771],"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.002016346,0.0003959902,0.006099879,0.0002737407,0.0000870497,0.0003048705,0.001953715,0.07114,0.01240842,0.87819,0.002811559,0.02431835],"study_design_scores_gemma":[0.0001008877,0.0001143825,0.001518029,0.00001619871,0.00005461707,0.0001002858,0.0002429295,0.2048938,0.005347736,0.7869834,0.0005775558,0.00005019684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9209095,0.0002011775,0.06808453,0.0008173691,0.00003195988,0.00006497258,0.000865517,0.0004337119,0.008591223],"genre_scores_gemma":[0.9903054,0.0001167331,0.006364046,0.00004809711,0.00005279563,0.00005635474,0.0006121635,0.00008749353,0.002356843],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01002472,"threshold_uncertainty_score":0.03353608,"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."}}