{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001743425,0.00008549099,0.0001821384,0.000438017,0.00006072521,0.0001700499,0.00201143,0.00001947333,0.000001667796],"category_scores_gemma":[0.0002220792,0.00007499052,0.00007529179,0.0003038931,0.0005627273,0.00162825,0.0004543104,0.00006698945,4.645598e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007263243,"about_ca_system_score_gemma":0.000283749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002876409,"about_ca_topic_score_gemma":0.000007081035,"domain_scores_codex":[0.998419,0.00005400892,0.0005017084,0.0001745321,0.0007306187,0.0001201425],"domain_scores_gemma":[0.9966896,0.0001407996,0.0006668297,0.0003162226,0.002088796,0.0000978129],"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.0002049498,0.0005847831,0.001770586,0.0000658032,0.0002304091,0.00001471183,0.006690939,0.005879618,0.03563372,0.6198367,0.002992611,0.3260951],"study_design_scores_gemma":[0.003951851,0.001651662,0.01527352,0.0004046836,0.00003162514,0.0007167537,0.0003614617,0.3497482,0.07868938,0.5458357,0.002973583,0.0003615475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1850775,0.00006687178,0.812347,0.001152751,0.001140768,0.00007390632,0.00001211836,0.00001326675,0.0001158611],"genre_scores_gemma":[0.7446501,0.000009690506,0.2551631,0.00006542372,0.00009474377,0.000001084463,0.000001553374,0.000002981967,0.00001138234],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5595726,"threshold_uncertainty_score":0.3737771,"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."}}