{"id":"W2091741450","doi":"10.1016/j.jcss.2008.02.007","title":"Lower bounds for the transition complexity of NFAs","year":2008,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Nondeterministic algorithm; Constant (computer programming); State (computer science); Combinatorics; Mathematics; Discrete mathematics; Computer science; Algorithm","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.005051342,0.001898746,0.00259837,0.004948016,0.00266143,0.008570453,0.005048623,0.003599869,0.01760105],"category_scores_gemma":[0.04821719,0.001437172,0.003820716,0.003392204,0.004271952,0.01652559,0.005096251,0.01154818,0.001755759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005858022,"about_ca_system_score_gemma":0.002398952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002191745,"about_ca_topic_score_gemma":0.003450779,"domain_scores_codex":[0.9922426,0.001552969,0.0004150038,0.00150629,0.002576067,0.001707042],"domain_scores_gemma":[0.8658396,0.1176259,0.002729881,0.007330603,0.003244905,0.003229127],"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.00119817,0.000505853,0.005138725,0.0009130175,0.000247713,0.0003333021,0.001193407,0.1572528,0.01052642,0.7427444,0.01252173,0.0674245],"study_design_scores_gemma":[0.00004602749,0.00007524455,0.001111839,0.00008160345,0.00009035315,0.000178052,0.0001023865,0.2706085,0.002549205,0.7227895,0.002305087,0.00006217383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2840951,0.005618549,0.6214291,0.01055799,0.0006456256,0.000326544,0.00331953,0.003014576,0.07099292],"genre_scores_gemma":[0.9062748,0.002278152,0.07193753,0.0009200856,0.001191251,0.0006056412,0.002423824,0.0009856807,0.01338315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01760105,"threshold_uncertainty_score":0.05888134,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.052486422567527,"score_gpt":0.2577307109255387,"score_spread":0.2052442883580117,"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."}}