{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00103585,0.0003123373,0.0008573079,0.0006845617,0.0008437994,0.002585429,0.001429367,0.0008595695,0.007931719],"category_scores_gemma":[0.01143927,0.0004283989,0.001010571,0.0005900062,0.001839046,0.004954688,0.002058825,0.001372576,0.0006947612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001666724,"about_ca_system_score_gemma":0.0008029194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001464442,"about_ca_topic_score_gemma":0.001246249,"domain_scores_codex":[0.9979343,0.0003745006,0.0002176951,0.0006229961,0.0005671673,0.0002832525],"domain_scores_gemma":[0.9849166,0.0110105,0.00101793,0.001523137,0.0008758533,0.0006558978],"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.001963583,0.0001950914,0.01090763,0.0006704191,0.00009805806,0.0007040125,0.002299797,0.2789464,0.04288077,0.6127722,0.002427031,0.04613505],"study_design_scores_gemma":[0.00005434671,0.0001638962,0.001822936,0.00002715883,0.0000488604,0.000249793,0.0001828027,0.5615246,0.01560781,0.4187521,0.001512009,0.00005378588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8718284,0.0002672388,0.1168997,0.0006273829,0.00002480174,0.00005732833,0.0007981686,0.0006671557,0.008829783],"genre_scores_gemma":[0.982834,0.00007675822,0.01387157,0.00004341214,0.00002177365,0.00007248732,0.0005187606,0.00008460251,0.002476738],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007931719,"threshold_uncertainty_score":0.0265342,"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."}}