{"id":"W1081471053","doi":"10.1016/j.ic.2017.09.002","title":"On the complexity and decidability of some problems involving shuffle","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Decidability; Combinatorics; Pushdown automaton; Discrete mathematics; Mathematics; Closure (psychology); Time complexity; Bounded function; Decision problem; Finite-state machine; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.01006977,0.001427007,0.003178222,0.003087219,0.005444186,0.01258048,0.006485983,0.005875914,0.01188303],"category_scores_gemma":[0.06829184,0.002011697,0.007239481,0.005058376,0.01156583,0.03408039,0.007122403,0.01458471,0.0007922167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007022583,"about_ca_system_score_gemma":0.005773006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005716029,"about_ca_topic_score_gemma":0.004802931,"domain_scores_codex":[0.9873768,0.004098884,0.0009362189,0.003133518,0.002632441,0.001822176],"domain_scores_gemma":[0.7790489,0.2052806,0.00412148,0.007196721,0.002103868,0.002248476],"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.0008920531,0.0006931169,0.004459341,0.0008789914,0.0002769851,0.0006648613,0.001960663,0.0539103,0.001979849,0.8924438,0.008645696,0.03319435],"study_design_scores_gemma":[0.00007902891,0.00002602126,0.0003735898,0.00003083742,0.00005561248,0.0001324394,0.0001702446,0.05620015,0.001000628,0.9409392,0.0009590967,0.00003304362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.425691,0.003999454,0.479607,0.03722586,0.0005213727,0.0005798713,0.003044582,0.001376441,0.04795437],"genre_scores_gemma":[0.8825103,0.001867031,0.09682773,0.001823858,0.001372852,0.0004722221,0.002886731,0.0004986908,0.01174071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01258048,"threshold_uncertainty_score":0.05325466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04185534428189584,"score_gpt":0.2631921773337993,"score_spread":0.2213368330519034,"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."}}