{"id":"W2430843852","doi":"10.1007/978-3-319-41114-9_5","title":"Unrestricted State Complexity of Binary Operations on 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":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Alphabet; Binary number; State (computer science); Product (mathematics); Combinatorics; Discrete mathematics; Quotient; Intersection (aeronautics); Time complexity; Mathematics; Regular language; Computer science; Arithmetic; Algorithm; Theoretical computer science; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005710726,0.0003992837,0.0004768531,0.0007624003,0.0001918401,0.0001993001,0.002825832,0.0001707025,0.00003466368],"category_scores_gemma":[0.00008079486,0.0002988788,0.0001129312,0.0005091049,0.001217639,0.0004164356,0.0009728396,0.000387844,0.00004145685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001506039,"about_ca_system_score_gemma":0.0003513693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002751318,"about_ca_topic_score_gemma":0.00002762804,"domain_scores_codex":[0.9971883,0.00006426236,0.0004772928,0.001041794,0.0007754144,0.0004529397],"domain_scores_gemma":[0.9974276,0.0004526265,0.000208053,0.001586685,0.0002019825,0.0001230111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001548532,0.00009151516,0.00002063001,0.00004929934,0.00002514846,0.0002304051,0.0007530659,0.02429484,0.006149046,0.4538946,0.00006191421,0.5144141],"study_design_scores_gemma":[0.0006560546,0.0007097123,0.001009327,0.001416412,0.00001101845,0.00008183011,5.40894e-7,0.3720963,0.01921678,0.6030074,0.0006940983,0.001100478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001952396,0.0002681227,0.9931011,0.00102642,0.0006446962,0.0002891518,0.00004251236,0.0001810312,0.002494534],"genre_scores_gemma":[0.6849331,0.00009901003,0.3111938,0.001724898,0.0003831078,0.00001160141,0.00001725091,0.00005846604,0.001578802],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6829807,"threshold_uncertainty_score":0.9999464,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02201696527997163,"score_gpt":0.2585983679494784,"score_spread":0.2365814026695068,"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."}}