{"id":"W4252967799","doi":"10.1142/s0129054119400355","title":"State Complexity of Suffix Distance","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Suffix; Prefix; Regular language; Mathematics; Upper and lower bounds; Neighbourhood (mathematics); Combinatorics; State (computer science); Discrete mathematics; Automaton; Computer science; Algorithm; Theoretical computer science","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.0009903399,0.0004384266,0.001339816,0.000838507,0.001380803,0.003400535,0.001937714,0.001229426,0.01020999],"category_scores_gemma":[0.01487553,0.0005067905,0.001971299,0.000921467,0.002295807,0.006327237,0.003723797,0.00199604,0.0009325983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001882852,"about_ca_system_score_gemma":0.001511344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002400626,"about_ca_topic_score_gemma":0.002208779,"domain_scores_codex":[0.9971014,0.0004410591,0.0002896666,0.0008998579,0.0007984538,0.0004695798],"domain_scores_gemma":[0.9806221,0.01296937,0.001148176,0.003064652,0.00130978,0.0008860367],"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.003980555,0.0004336977,0.01512527,0.001138425,0.0002419318,0.0008613929,0.002623365,0.3677757,0.06565136,0.4523216,0.006077858,0.08376876],"study_design_scores_gemma":[0.00008113661,0.0002965508,0.002419969,0.00004565197,0.0001130368,0.0003047484,0.0002357674,0.5339879,0.01993792,0.4404702,0.002001598,0.0001054707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8134442,0.0003849263,0.1675091,0.001025487,0.00006794259,0.000149049,0.001885394,0.001444538,0.01408939],"genre_scores_gemma":[0.9763594,0.0001502837,0.01765112,0.00007535881,0.00003346337,0.0001383099,0.001008197,0.000176785,0.004406936],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01020999,"threshold_uncertainty_score":0.03415591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02089679795485872,"score_gpt":0.2927944941874978,"score_spread":0.271897696232639,"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."}}