{"id":"W1965531865","doi":"10.1142/s0129054105003364","title":"RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Unary operation; Mathematics; Regular language; Context (archaeology); Set (abstract data type); Discrete mathematics; Context-free language; Combinatorics; Computer science; Automaton; Theoretical computer science; Programming language; Artificial intelligence; Rule-based machine translation","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.0006965253,0.00007633667,0.0001954719,0.0005223714,0.00007150773,0.00009467403,0.001671576,0.00002298512,0.00001078015],"category_scores_gemma":[0.0001518093,0.00006773842,0.0000808679,0.0005936833,0.0005866432,0.001620946,0.0002736088,0.00007894742,5.903384e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006045188,"about_ca_system_score_gemma":0.0003836555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001868025,"about_ca_topic_score_gemma":0.000005465306,"domain_scores_codex":[0.9982526,0.00004671933,0.0007095843,0.0001537993,0.0007346311,0.0001026195],"domain_scores_gemma":[0.9968493,0.0003643248,0.0007028544,0.0002589265,0.00175475,0.00006982071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00009869665,0.00155989,0.01956248,0.00004645392,0.0002412826,0.00001066788,0.005031153,0.01288145,0.09676436,0.4065321,0.0003857677,0.4568857],"study_design_scores_gemma":[0.001617527,0.0008130339,0.4686086,0.0003821379,0.00003689202,0.0005480053,0.00009329461,0.3394244,0.1312885,0.0559792,0.0009031354,0.0003052276],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5317529,0.00005002341,0.4669203,0.0006779559,0.0004730508,0.0000345235,0.000006340462,0.000006241436,0.00007871905],"genre_scores_gemma":[0.7320655,0.00001659521,0.2678225,0.00002827408,0.00006272508,4.665247e-7,6.349688e-7,0.000001547847,0.000001723822],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4565805,"threshold_uncertainty_score":0.3106232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01234376465392803,"score_gpt":0.3010579654795872,"score_spread":0.2887142008256592,"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."}}