{"id":"W2178095809","doi":"10.1142/s0129054115500124","title":"State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Prefix; Intersection (aeronautics); Upper and lower bounds; Alphabet; Combinatorics; Mathematics; State (computer science); Discrete mathematics; Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; Binary number; Automaton; Automata theory; Computer science; Arithmetic; Theoretical computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001716804,0.0007183733,0.001416048,0.001157478,0.001808993,0.004902137,0.002356335,0.001124261,0.006135588],"category_scores_gemma":[0.01212736,0.0007963261,0.002209794,0.001341187,0.003059432,0.009092084,0.003620624,0.003501763,0.0005909762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004216068,"about_ca_system_score_gemma":0.003135013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003316871,"about_ca_topic_score_gemma":0.003500623,"domain_scores_codex":[0.9963155,0.0004642096,0.0003568761,0.0009821273,0.0009644678,0.0009168269],"domain_scores_gemma":[0.9754322,0.01820864,0.002020856,0.002365163,0.001126612,0.0008464697],"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.002048306,0.0005644961,0.01571186,0.001012481,0.0001997289,0.0005346016,0.002721155,0.4014613,0.04044217,0.4526996,0.005112898,0.07749145],"study_design_scores_gemma":[0.00004250974,0.0001514443,0.00186084,0.00004770877,0.00009978092,0.0001946164,0.0002452871,0.6586707,0.03462986,0.3022598,0.00169927,0.00009808941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6740795,0.0005064074,0.3059621,0.001893944,0.00007718099,0.0001562191,0.00132976,0.001713651,0.01428122],"genre_scores_gemma":[0.9524801,0.0001844472,0.04307509,0.0001186234,0.00005637254,0.0001886747,0.0009035782,0.0002726405,0.002720596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006135588,"threshold_uncertainty_score":0.03058988,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03549565474146355,"score_gpt":0.3102429891193492,"score_spread":0.2747473343778857,"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."}}