{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001412302,0.00007067327,0.0002158501,0.00008520385,0.0003756047,0.0001090604,0.0007135019,0.00002125858,0.000001043933],"category_scores_gemma":[0.000004618203,0.00003806837,0.0001140745,0.0002062693,0.0004727569,0.0004506454,0.00004644752,0.0000516507,3.513408e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001033876,"about_ca_system_score_gemma":0.00007518877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006947138,"about_ca_topic_score_gemma":7.172632e-7,"domain_scores_codex":[0.9989871,0.00006978457,0.0003687606,0.0001141649,0.0003363186,0.0001238335],"domain_scores_gemma":[0.9990952,0.0002945936,0.0002861966,0.0001291601,0.0001480381,0.00004682244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001255961,0.0003159893,0.001148739,0.0004331206,0.0001923448,0.00008487396,0.01860437,0.004812905,0.001548496,0.8983545,0.007753937,0.06662519],"study_design_scores_gemma":[0.0008818351,0.001494491,0.01146966,0.0002865457,0.0000244627,0.003420803,0.0006709407,0.969453,0.000684248,0.01017462,0.001259415,0.0001799724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1798173,0.0005968251,0.8177897,0.0007031865,0.000877215,0.00007314525,0.000001483634,0.00001087751,0.0001303014],"genre_scores_gemma":[0.967194,0.0000225264,0.03244943,0.0001173778,0.0002083645,8.18358e-7,5.209866e-8,0.000001555413,0.000005844674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9646401,"threshold_uncertainty_score":0.2888886,"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."}}