{"id":"W2758996273","doi":"10.25596/jalc-2017-169","title":"State Complexity of Prefix Distance of Subregular Languages","year":2017,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Prefix; Upper and lower bounds; Mathematics; Regular language; Combinatorics; Deterministic finite automaton; Finite-state machine; Alphabet; Neighbourhood (mathematics); Nondeterministic finite automaton; Discrete mathematics; Automaton; Computer science; Algorithm; Automata theory; 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.000304077,0.000188491,0.0003883749,0.0001084745,0.0002897327,0.00008223995,0.00267589,0.00006782213,0.00004276971],"category_scores_gemma":[0.00004771606,0.0001827778,0.0001446133,0.0001460673,0.0006307847,0.001586819,0.0009715825,0.0001213144,0.00002312112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000614176,"about_ca_system_score_gemma":0.00009286319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005048505,"about_ca_topic_score_gemma":0.00008908303,"domain_scores_codex":[0.9985763,0.00007615747,0.000255879,0.0003877944,0.0003853172,0.0003185918],"domain_scores_gemma":[0.9974207,0.00006271542,0.0005021862,0.001762219,0.0001481915,0.0001040006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001535768,0.0004436901,0.007628063,0.0004765674,0.0002962936,0.0002181912,0.007892828,0.0001425348,0.02005513,0.9037238,0.002671745,0.05629753],"study_design_scores_gemma":[0.008358226,0.001232663,0.5850902,0.001157082,0.0003741184,0.00006468692,0.0091277,0.0383666,0.1695787,0.1528251,0.03097411,0.002850819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8567443,0.0005935581,0.1158491,0.0009637861,0.0003938805,0.000306729,0.0001786592,0.0002236186,0.02474635],"genre_scores_gemma":[0.9897357,0.00005550962,0.008429131,0.00003673425,0.00003081485,9.682024e-7,0.000007858388,0.00001181275,0.001691435],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7508987,"threshold_uncertainty_score":0.7453464,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02465598739733126,"score_gpt":0.2523142439967095,"score_spread":0.2276582565993783,"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."}}