{"id":"W2260622622","doi":"10.1007/978-3-319-41114-9_6","title":"On the State Complexity of the Shuffle of Regular Languages","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Alphabet; Upper and lower bounds; Deterministic finite automaton; State (computer science); Finite-state machine; Nondeterministic finite automaton; 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.001384488,0.000560587,0.000845481,0.0007743709,0.0009466386,0.002897967,0.00137932,0.0008696901,0.005418066],"category_scores_gemma":[0.008252414,0.0005906772,0.001629966,0.0008771694,0.00245829,0.008781283,0.002153589,0.002724841,0.0004879031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002291839,"about_ca_system_score_gemma":0.001098239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001614146,"about_ca_topic_score_gemma":0.001552428,"domain_scores_codex":[0.9980665,0.0004364799,0.0001296666,0.0004323361,0.0005575496,0.0003774473],"domain_scores_gemma":[0.9820608,0.01518025,0.0007713647,0.001221919,0.0004202385,0.000345425],"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.0009216929,0.0002633705,0.005075641,0.0005206348,0.0001164866,0.0003835077,0.001393756,0.235252,0.02899225,0.6708879,0.00224995,0.05394283],"study_design_scores_gemma":[0.00003794408,0.0002072039,0.002056283,0.00004370578,0.00006187898,0.0001940941,0.0001643641,0.4282079,0.01726224,0.5488703,0.002826798,0.00006725521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7115597,0.0009039203,0.2604481,0.001610344,0.00006439198,0.0001172189,0.000565448,0.0005471666,0.02418385],"genre_scores_gemma":[0.9608136,0.0005065819,0.03124412,0.0001068207,0.00009184782,0.0001316808,0.0004704503,0.0001597433,0.006475161],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005418066,"threshold_uncertainty_score":0.01812524,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01866464202560329,"score_gpt":0.2377675525431993,"score_spread":0.2191029105175961,"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."}}