{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089489,0.0002868577,0.000378567,0.0001986185,0.000150246,0.00008349443,0.005022366,0.0001056205,0.00003260717],"category_scores_gemma":[0.0001211949,0.0001358175,0.0001623881,0.000352477,0.002405226,0.0001562345,0.001498334,0.000361294,0.00001013052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006966285,"about_ca_system_score_gemma":0.0001903108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002257792,"about_ca_topic_score_gemma":0.00002628428,"domain_scores_codex":[0.9976837,0.00008698532,0.0003982139,0.0006304106,0.0008708923,0.0003298158],"domain_scores_gemma":[0.9961424,0.001100112,0.0004486402,0.002117951,0.000144626,0.00004626932],"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.000005467989,0.00002254833,0.00001502065,0.00002922531,0.00001255772,0.000006549737,0.0008083578,0.001372595,0.001249622,0.8043849,0.00005343949,0.1920397],"study_design_scores_gemma":[0.0001220456,0.00009425007,0.0003436768,0.0006410441,0.000003958657,0.00001133619,3.750636e-7,0.02621689,0.0286703,0.9434699,0.0002116197,0.0002146129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002855273,0.0002664002,0.9891642,0.002260144,0.0006657614,0.0003043289,0.0000247533,0.00004856295,0.004410576],"genre_scores_gemma":[0.9673428,0.00002128249,0.02994607,0.001708592,0.0001316615,0.000004293602,6.71028e-7,0.00002444321,0.0008202062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9644875,"threshold_uncertainty_score":0.9332888,"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."}}