{"id":"W1859305636","doi":"10.1016/j.ic.2017.08.014","title":"Syntactic complexity of suffix-free languages","year":2017,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki; Narodowe Centrum Nauki","keywords":"Regular language; Cardinality (data modeling); Suffix; Semigroup; Alphabet; Discrete mathematics; Mathematics; Upper and lower bounds; State (computer science); Combinatorics; Automaton; Quotient; Computer science; Theoretical computer science; Algorithm; Linguistics","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.002109016,0.0005357338,0.001284644,0.002182386,0.001868618,0.007305945,0.001798156,0.001904085,0.009808118],"category_scores_gemma":[0.01394542,0.0007515423,0.001382181,0.002492829,0.004014344,0.01468666,0.003025467,0.003403672,0.0008958955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00272793,"about_ca_system_score_gemma":0.001655273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001229789,"about_ca_topic_score_gemma":0.0009529763,"domain_scores_codex":[0.9962632,0.0009907095,0.000276248,0.0006311022,0.001363294,0.000475412],"domain_scores_gemma":[0.9787638,0.01646937,0.001120947,0.00153668,0.001461798,0.0006473463],"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.0001058192,0.00004576557,0.0009587951,0.0001119564,0.00001965261,0.0001242627,0.0006325435,0.004768685,0.001297361,0.9840415,0.001784369,0.006109337],"study_design_scores_gemma":[0.000007709124,0.000005341858,0.0002050479,0.000006611581,0.000007564184,0.00003988959,0.00004585287,0.008602491,0.000353425,0.9901682,0.000548459,0.000009335167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7453647,0.001573159,0.1772201,0.009492397,0.0002072399,0.00007578044,0.00206889,0.0005836927,0.06341411],"genre_scores_gemma":[0.9845271,0.0004641973,0.008077591,0.0003065712,0.0003091602,0.00007434945,0.0008362933,0.0001385527,0.005266329],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009808118,"threshold_uncertainty_score":0.03281146,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03233763284079785,"score_gpt":0.2946075498334217,"score_spread":0.2622699169926239,"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."}}