{"id":"W2049709665","doi":"10.1016/j.tcs.2009.04.016","title":"On the uniqueness of shuffle on words and finite languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Uniqueness; Factorization; Regular language; Mathematics; Decomposition; Finite set; Combinatorics; Discrete mathematics; Combinatorics on words; Computer science; Word (group theory); Theoretical computer science; Algorithm; Automaton","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.001304203,0.0001288213,0.0001448163,0.0001104078,0.0002087708,0.0001869847,0.001680072,0.00003120169,0.0000196281],"category_scores_gemma":[0.0001312095,0.00007446037,0.00003485759,0.0006339111,0.001495266,0.0001901451,0.0003106788,0.0001457837,0.00001480242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001370032,"about_ca_system_score_gemma":0.00003500173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001323393,"about_ca_topic_score_gemma":8.639165e-8,"domain_scores_codex":[0.9986059,0.0001183647,0.0001537292,0.0003964617,0.000438715,0.0002868385],"domain_scores_gemma":[0.9979524,0.001100719,0.00005210865,0.0007484716,0.00004703589,0.00009928096],"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.000007521674,0.00004347911,0.000004961287,0.000001697726,0.000001086347,0.000005203328,0.0004531097,0.00009445748,0.0004784882,0.9413275,0.00002544947,0.05755701],"study_design_scores_gemma":[0.0001190479,0.000625531,0.001704784,0.0000717702,0.000001844759,0.000009847759,0.0000193792,0.228617,0.01770925,0.7509594,0.00002399354,0.0001382025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3584157,0.00002966606,0.629904,0.004162289,0.0001290553,0.0001093456,0.00000125546,0.0001103931,0.007138284],"genre_scores_gemma":[0.9863322,0.00000447294,0.009900233,0.003714081,0.00003554278,0.000001608641,1.489663e-7,0.000003021184,0.000008718916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6279165,"threshold_uncertainty_score":0.550937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007427173008570303,"score_gpt":0.2465554775301102,"score_spread":0.2391283045215399,"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."}}