{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001612717,0.000523567,0.001339914,0.001337548,0.001355437,0.005621899,0.002573017,0.00168999,0.01140982],"category_scores_gemma":[0.01429682,0.0006692153,0.001245755,0.001778144,0.002670728,0.009805922,0.00324553,0.00341749,0.0007887137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002918177,"about_ca_system_score_gemma":0.001766508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00165648,"about_ca_topic_score_gemma":0.001397505,"domain_scores_codex":[0.9975072,0.0005336269,0.0001738283,0.0005629428,0.0008089251,0.0004135285],"domain_scores_gemma":[0.9778972,0.01757134,0.001025207,0.001610952,0.001063195,0.0008322388],"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.0004675873,0.0001031822,0.00221867,0.0002037436,0.00004002155,0.0001506916,0.0007990811,0.04284411,0.004050575,0.9296829,0.002139417,0.0173],"study_design_scores_gemma":[0.00002649206,0.00003702246,0.0005524551,0.00001389998,0.00002050681,0.0000664119,0.00009130889,0.1284151,0.001359731,0.8688478,0.0005454464,0.000023895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8136626,0.0007521707,0.1562676,0.00182257,0.00009006749,0.0000708586,0.001308997,0.0004696487,0.02555551],"genre_scores_gemma":[0.9837134,0.0002960313,0.009821688,0.0000870289,0.0001334464,0.00008940783,0.0007459096,0.0001542319,0.004958881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01140982,"threshold_uncertainty_score":0.03816962,"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."}}