{"id":"W2397866482","doi":"10.1016/j.tcs.2016.05.018","title":"State complexity of prefix distance","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Suffix; Generalized suffix tree; Prefix; Combinatorics; Regular language; Mathematics; Deterministic finite automaton; Nondeterministic algorithm; Nondeterministic finite automaton; Discrete mathematics; State (computer science); Suffix tree; Set (abstract data type); Finite-state machine; Automaton; Computer science; Algorithm; Theoretical computer science; Automata theory","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.00236908,0.0005519718,0.001850321,0.001942572,0.002027813,0.007423308,0.00283002,0.002711565,0.01540565],"category_scores_gemma":[0.02392245,0.0007602858,0.001421201,0.002983263,0.003921926,0.01813097,0.004761267,0.004204904,0.000943546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003360262,"about_ca_system_score_gemma":0.002178097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001944787,"about_ca_topic_score_gemma":0.001392588,"domain_scores_codex":[0.9961091,0.001013762,0.000278423,0.0008056557,0.001120074,0.0006729024],"domain_scores_gemma":[0.9598173,0.03243057,0.001685015,0.002937383,0.001705292,0.001424361],"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.0002234563,0.00006374798,0.001206942,0.00009478822,0.00002374898,0.00007931522,0.0004572676,0.01871356,0.0009347717,0.9687353,0.001237398,0.008229746],"study_design_scores_gemma":[0.00002224998,0.00002147612,0.0002750375,0.000009929893,0.00001567859,0.00004435854,0.00006099533,0.06242817,0.000560836,0.9360994,0.0004445517,0.00001731083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7230008,0.0009113773,0.2308596,0.005316833,0.000123633,0.00009529603,0.001689945,0.0005072429,0.03749532],"genre_scores_gemma":[0.982771,0.0003367371,0.009901714,0.000157117,0.0001502874,0.0001059,0.0006672562,0.0001101335,0.005799839],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01540565,"threshold_uncertainty_score":0.05153704,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01678446329125288,"score_gpt":0.2448497452975817,"score_spread":0.2280652820063288,"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."}}