{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023288,0.00008866883,0.0002160405,0.0004510499,0.0000498923,0.0001729542,0.003718729,0.0000150801,0.00004695689],"category_scores_gemma":[0.00005948663,0.00007693814,0.0001116657,0.000575711,0.0006202199,0.001934847,0.000429231,0.0001025291,0.00001286421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007492911,"about_ca_system_score_gemma":0.0004009004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001316633,"about_ca_topic_score_gemma":0.000002355477,"domain_scores_codex":[0.9978228,0.00003980048,0.0006604837,0.0001874506,0.001142765,0.0001467642],"domain_scores_gemma":[0.9966314,0.0001679516,0.0009066584,0.0003910934,0.001831945,0.00007090971],"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.00003955363,0.0003748806,0.006209825,0.00002197413,0.00009325271,0.00000856704,0.00139668,0.00733833,0.01496636,0.8595643,0.0002388917,0.1097474],"study_design_scores_gemma":[0.001897728,0.0009597644,0.1223969,0.0005065679,0.00001315954,0.0002777268,0.00006662895,0.5682704,0.0497543,0.2508883,0.004540797,0.0004276514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3258462,0.00002893029,0.6713287,0.000557067,0.001734117,0.00004277431,0.00000590614,0.000009205582,0.0004471417],"genre_scores_gemma":[0.8695776,0.00001441978,0.1302482,0.00006315138,0.0000579788,2.911856e-7,7.90967e-7,0.000002671748,0.00003491217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.608676,"threshold_uncertainty_score":0.6910385,"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."}}