{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630739,0.0004577597,0.0004982812,0.001111385,0.0009568558,0.002114497,0.0007552832,0.0004531879,0.002649784],"category_scores_gemma":[0.003964126,0.0004166339,0.001138445,0.0005154919,0.002660038,0.006175567,0.001906686,0.001437911,0.0005038021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001165143,"about_ca_system_score_gemma":0.0007342919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007460567,"about_ca_topic_score_gemma":0.0007606988,"domain_scores_codex":[0.9984836,0.0002619558,0.0001574691,0.0003961473,0.0003765044,0.000324313],"domain_scores_gemma":[0.9971546,0.001130333,0.0003904944,0.0005190047,0.0004384723,0.0003670438],"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.0001169284,0.00006202867,0.0008618561,0.00006471045,0.00001331967,0.0002324863,0.0009232757,0.004162669,0.01067282,0.9675802,0.0004029496,0.01490671],"study_design_scores_gemma":[0.00002228701,0.00006751739,0.0003987856,0.00002587647,0.00001551932,0.0002561182,0.0002826758,0.02894777,0.01492093,0.9498535,0.005183794,0.00002517759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4461584,0.0004677879,0.536701,0.0002714068,0.00008586505,0.0001498913,0.0002610718,0.0006848286,0.01521978],"genre_scores_gemma":[0.8861941,0.0002183111,0.1044207,0.0001008015,0.00006006842,0.000164968,0.0004685043,0.0002321413,0.008140327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002649784,"threshold_uncertainty_score":0.008864403,"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."}}