{"id":"W2980258839","doi":"","title":"Upper Bound on Syntactic Complexity of Suffix-Free Languages","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Cardinality (data modeling); Semigroup; Suffix; Upper and lower bounds; Alphabet; Mathematics; Combinatorics; Discrete mathematics; State (computer science); Quotient; Automaton; Computer science; Algorithm; Theoretical computer science; 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.002368389,0.0005537587,0.001097144,0.001140212,0.001439118,0.003278385,0.001896084,0.0013718,0.01058685],"category_scores_gemma":[0.01988373,0.000667428,0.001597746,0.0006372256,0.003227725,0.007968966,0.003681598,0.002903399,0.0009002944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001679003,"about_ca_system_score_gemma":0.001485147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005217469,"about_ca_topic_score_gemma":0.0006493123,"domain_scores_codex":[0.9958884,0.0007799135,0.0003092935,0.0009476135,0.001522037,0.0005528891],"domain_scores_gemma":[0.9473168,0.04281543,0.001819504,0.004272767,0.002053168,0.001722281],"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.001225876,0.0004291876,0.01150334,0.0008362002,0.0001394852,0.001085709,0.002965058,0.054761,0.05803542,0.8321007,0.005264296,0.03165368],"study_design_scores_gemma":[0.00006653384,0.0001776542,0.002541286,0.00007693317,0.00007515324,0.0005481361,0.0002265986,0.1376129,0.01847256,0.8353257,0.004800629,0.00007581155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7680296,0.0006570623,0.1862165,0.003994967,0.0001745,0.0001507769,0.00144359,0.001207866,0.03812521],"genre_scores_gemma":[0.9753997,0.0001477512,0.02027352,0.0002111805,0.0001477112,0.0001301358,0.0005501584,0.0001669309,0.002972939],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01058685,"threshold_uncertainty_score":0.03541654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05045026808207155,"score_gpt":0.1871688219222853,"score_spread":0.1367185538402138,"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."}}