{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001347322,0.000163565,0.0002409846,0.0001191126,0.000181804,0.0001281745,0.003234854,0.00002709533,0.00005762208],"category_scores_gemma":[0.00008021945,0.00009712958,0.00006912235,0.000808294,0.008069877,0.0008202019,0.001229583,0.00007605033,0.0000672018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004813511,"about_ca_system_score_gemma":0.00009539005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002499151,"about_ca_topic_score_gemma":5.35955e-7,"domain_scores_codex":[0.9976954,0.0001065279,0.0003329387,0.0006428852,0.0006809405,0.0005413298],"domain_scores_gemma":[0.997984,0.0003350318,0.0001188135,0.001157836,0.0001815488,0.0002228035],"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.000007349289,0.00004368404,0.00008931805,0.000006046505,0.000002406422,0.000003793686,0.0001595,0.000005092851,0.005472606,0.9023367,0.00002748041,0.09184602],"study_design_scores_gemma":[0.000253856,0.0001484248,0.003055369,0.00007107206,0.000001607754,0.00001515268,0.000001665729,0.07779958,0.04433599,0.873984,0.0001400041,0.0001932642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07601975,0.00002210887,0.920427,0.001167277,0.000352309,0.00009671273,0.000008177319,0.0001946091,0.001712102],"genre_scores_gemma":[0.8838148,0.000005210701,0.1159186,0.0001969497,0.00003524005,0.000002877274,1.400378e-7,0.000005543435,0.00002068786],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.807795,"threshold_uncertainty_score":0.9946296,"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."}}