{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004692866,0.0007399783,0.001862769,0.002288718,0.003449751,0.00386021,0.00191972,0.003445775,0.005387631],"category_scores_gemma":[0.02039604,0.001324482,0.001875121,0.001983181,0.009155856,0.02249189,0.006774601,0.00511838,0.0008148906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001374066,"about_ca_system_score_gemma":0.001414522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008556353,"about_ca_topic_score_gemma":0.0007198526,"domain_scores_codex":[0.9980374,0.0008155136,0.0001606241,0.000443092,0.0002694274,0.0002738992],"domain_scores_gemma":[0.9818079,0.01425951,0.0006484388,0.001233773,0.001282757,0.0007676582],"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.00008222484,0.00002132298,0.0004783756,0.00005784495,0.00001493074,0.0001056405,0.0004412385,0.001254283,0.0004283773,0.9911479,0.0006510898,0.00531682],"study_design_scores_gemma":[0.000006901173,0.00001627489,0.00009514336,0.00001262961,0.000006037949,0.00006846042,0.00009672096,0.002021243,0.0002312364,0.9965333,0.0009010816,0.00001095697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2774401,0.007073613,0.6517526,0.007545587,0.0009913734,0.0001016473,0.0003707662,0.0003047403,0.05441955],"genre_scores_gemma":[0.8937097,0.003504199,0.07431503,0.001491364,0.001114524,0.0001956964,0.0004489151,0.0003422893,0.02487838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005387631,"threshold_uncertainty_score":0.02481854,"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."}}