{"id":"W3000767751","doi":"10.1016/j.jcss.2017.05.011","title":"Complexity of suffix-free regular languages","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Suffix; Regular language; Computer science; Abstract family of languages; Mathematics; Programming language; Theoretical computer science; Linguistics; Second-generation programming language; Automaton; Fifth-generation programming language; Philosophy","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":[],"consensus_categories":[],"category_scores_codex":[0.001875586,0.00008950545,0.0003206406,0.0001230343,0.0003937563,0.0005045019,0.002848187,0.0000291093,0.00000167205],"category_scores_gemma":[0.00003222375,0.00005869527,0.00008753087,0.00008602991,0.0005855166,0.0008700867,0.0005347389,0.00007065694,9.793595e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001038685,"about_ca_system_score_gemma":0.0000602367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002854195,"about_ca_topic_score_gemma":0.000002679258,"domain_scores_codex":[0.9987523,0.00009592323,0.0003943749,0.0001573234,0.0004497728,0.0001503141],"domain_scores_gemma":[0.9983131,0.00009658886,0.0007961553,0.0005736551,0.0001358763,0.00008460059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001054,0.00006622849,0.007181243,0.0001903576,0.00004999877,0.000116177,0.001535062,0.00007961346,0.0008826244,0.9453676,0.002140091,0.04238049],"study_design_scores_gemma":[0.0041363,0.003244479,0.4207967,0.003299942,0.00007821489,0.006712025,0.003771631,0.427262,0.01001603,0.1175309,0.002098136,0.001053544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6373771,0.001420415,0.3543157,0.001467284,0.001318491,0.00007631617,0.000003365738,0.00003388303,0.003987455],"genre_scores_gemma":[0.9419882,0.00001247256,0.05774377,0.00003617632,0.0001996604,1.86015e-7,3.438032e-8,0.000001857149,0.00001759248],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8278366,"threshold_uncertainty_score":0.5292689,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03649435107061784,"score_gpt":0.2823225180987742,"score_spread":0.2458281670281564,"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."}}