{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001697941,0.0005522281,0.001383317,0.001757122,0.001651517,0.007525282,0.002474666,0.001874934,0.01331722],"category_scores_gemma":[0.01806071,0.000777748,0.001400512,0.001931309,0.002942112,0.01288799,0.002791716,0.002657745,0.0008454351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002606095,"about_ca_system_score_gemma":0.001917766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001520901,"about_ca_topic_score_gemma":0.001545564,"domain_scores_codex":[0.9968321,0.000710387,0.0002379264,0.0005740744,0.001167475,0.0004781002],"domain_scores_gemma":[0.9656876,0.02820952,0.001701802,0.001633536,0.001328019,0.001439436],"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.0006265596,0.0002438457,0.005300948,0.0003024273,0.00008109085,0.0004859444,0.001758158,0.04164691,0.005187387,0.9228828,0.004109355,0.01737462],"study_design_scores_gemma":[0.00005252103,0.00003107222,0.0007433135,0.00001125299,0.00002397817,0.0002016604,0.000166953,0.06985483,0.001009589,0.9270121,0.0008658944,0.00002670115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8624281,0.0006455115,0.1005739,0.004884983,0.00009649638,0.0000852486,0.001504277,0.0004625862,0.02931878],"genre_scores_gemma":[0.9842808,0.0002464026,0.007938661,0.0001796661,0.0001840204,0.00006986201,0.0009091356,0.0001062363,0.006085276],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01331722,"threshold_uncertainty_score":0.04455054,"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."}}