{"id":"W2482750740","doi":"10.1007/978-3-319-41114-9_15","title":"State Complexity of Prefix Distance of Subregular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Upper and lower bounds; Regular language; Deterministic finite automaton; Neighbourhood (mathematics); Finite-state machine; Combinatorics; Alphabet; Mathematics; Nondeterministic finite automaton; Discrete mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008081348,0.0003858386,0.0006831979,0.0004385339,0.00007609204,0.00008327562,0.003449366,0.0001514409,0.00002771293],"category_scores_gemma":[0.00005711915,0.0002925991,0.0001494373,0.0003706509,0.002249258,0.0004213323,0.001168327,0.0002780177,0.000009301296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00010297,"about_ca_system_score_gemma":0.0002678898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000213951,"about_ca_topic_score_gemma":0.00003950201,"domain_scores_codex":[0.997036,0.00004601701,0.0006247326,0.000961102,0.0008690956,0.0004631019],"domain_scores_gemma":[0.9969751,0.0004298009,0.0005919149,0.001656891,0.0002436564,0.0001026551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001327844,0.0000443601,0.0001202567,0.0001724903,0.00002068233,0.00003871133,0.0008949956,0.000999706,0.002707568,0.4087225,0.00001331431,0.5862522],"study_design_scores_gemma":[0.0003594005,0.0001960823,0.0007187888,0.00123584,0.000007835454,0.00002782553,3.502862e-7,0.04810199,0.0382742,0.9099761,0.0005032877,0.0005982772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009873364,0.0009445786,0.9941569,0.0002648972,0.000475457,0.0002248113,0.0000583647,0.00008977809,0.002797861],"genre_scores_gemma":[0.7809751,0.00006457307,0.2179645,0.0002388914,0.0001346346,0.000003737394,0.000003629371,0.00003141551,0.0005835312],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7799878,"threshold_uncertainty_score":0.9999526,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01602923877316603,"score_gpt":0.2423802415762286,"score_spread":0.2263510028030625,"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."}}