{"id":"W1550738266","doi":"10.25596/jalc-2004-217","title":"State Complexity of Shuffle on Trajectories","year":2004,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Upper and lower bounds; State (computer science); String (physics); Mathematics; Computational complexity theory; Constant (computer programming); Trajectory; Combinatorics; Time complexity; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Physics","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.001274076,0.0005564613,0.001160863,0.001314746,0.001274223,0.00310353,0.001473832,0.001109497,0.007234414],"category_scores_gemma":[0.01201733,0.0004458124,0.001391713,0.001643608,0.001862943,0.007799344,0.00259866,0.002249747,0.0007676182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002764377,"about_ca_system_score_gemma":0.002588511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002970127,"about_ca_topic_score_gemma":0.002835358,"domain_scores_codex":[0.9972173,0.0003343709,0.0002353791,0.0005540008,0.000866444,0.0007924502],"domain_scores_gemma":[0.9838772,0.009959818,0.00103939,0.002744647,0.001681744,0.0006971445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001141337,0.0001759154,0.005567547,0.0004798437,0.00008747448,0.0002511398,0.0006066353,0.4630016,0.02604355,0.4432043,0.002795327,0.05664532],"study_design_scores_gemma":[0.00001905457,0.00008518149,0.0008501976,0.00003276078,0.00002448424,0.00008334543,0.00007897311,0.6701007,0.01876717,0.308276,0.001641676,0.00004051656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4954309,0.0004224588,0.4890129,0.0009305074,0.00004117081,0.0001598916,0.001685205,0.001231807,0.0110852],"genre_scores_gemma":[0.9310324,0.0003912091,0.05877889,0.0001329126,0.00003582435,0.0003178782,0.002046574,0.0003336562,0.006930629],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007234414,"threshold_uncertainty_score":0.02420157,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04238509054814154,"score_gpt":0.2690829022559006,"score_spread":0.226697811707759,"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."}}