{"id":"W2061015906","doi":"10.1142/s0129054102001461","title":"SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University; University of Prince Edward Island","funders":"","keywords":"Undecidable problem; Closure (psychology); Regular language; Equivalence (formal languages); Quotient; Decomposition; Mathematics; Context-free language; Abstract family of languages; Discrete mathematics; Context (archaeology); Computer science; Combinatorics; Decidability; Theoretical computer science; Automaton; Programming language; Rule-based machine translation; Natural language processing","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.0006113572,0.00007598498,0.0001592549,0.0006139447,0.00008167925,0.0001579128,0.002861988,0.00002018515,0.00006590666],"category_scores_gemma":[0.00007585286,0.00006741368,0.0001161679,0.0005656933,0.0003546831,0.001583233,0.0002900661,0.00008285399,0.000008938781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000520478,"about_ca_system_score_gemma":0.00009781468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007439462,"about_ca_topic_score_gemma":8.648648e-7,"domain_scores_codex":[0.9982932,0.00003604826,0.0005406894,0.0001458425,0.0008628665,0.0001213814],"domain_scores_gemma":[0.9975571,0.0001621468,0.0005838508,0.0003231674,0.001304204,0.00006954689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001113867,0.0008094462,0.000953524,0.00001483048,0.0001616373,0.00005066705,0.002602369,0.005843768,0.05175832,0.5976181,0.002187421,0.3379888],"study_design_scores_gemma":[0.001816658,0.000833056,0.02794708,0.0005755881,0.00004147326,0.001747029,0.0001759872,0.7695969,0.1301354,0.06140414,0.00523096,0.0004956989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1126541,0.000152965,0.8834867,0.001655951,0.001043418,0.00003516528,0.000004224341,0.00001618005,0.0009512967],"genre_scores_gemma":[0.763153,0.00002434484,0.2366015,0.0000875176,0.0001078661,4.536427e-7,5.4913e-7,0.000002301829,0.00002254637],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7637532,"threshold_uncertainty_score":0.5318334,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01349692910403663,"score_gpt":0.2898611299835407,"score_spread":0.276364200879504,"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."}}