{"id":"W2109787457","doi":"10.3233/fi-2009-0008","title":"Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Prefix; Computer science; Regular language; State (computer science); Theoretical computer science; Programming language; Arithmetic; Mathematics; Automaton; Linguistics","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.0002980712,0.0001314561,0.0002133987,0.00009159611,0.0001336529,0.0001689307,0.000989921,0.00003043162,0.00003913009],"category_scores_gemma":[0.00008517945,0.0001139091,0.00007766076,0.0001537086,0.0001051404,0.0008229652,0.0001729615,0.00005874732,0.00002665941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003267955,"about_ca_system_score_gemma":0.00005255685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008405586,"about_ca_topic_score_gemma":0.00000618307,"domain_scores_codex":[0.9989097,0.0000246283,0.0004584875,0.0001362935,0.0002207922,0.0002501615],"domain_scores_gemma":[0.998798,0.00009415905,0.000116216,0.0008507189,0.00006572893,0.00007522966],"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.00003475525,0.0002726824,0.00006462984,0.0002604882,0.00005773559,0.000004136144,0.008692528,0.0003885331,0.003382192,0.9101135,0.007599236,0.06912958],"study_design_scores_gemma":[0.003727711,0.001931881,0.009297051,0.0002635829,0.000055951,0.00005845057,0.001675171,0.6812302,0.03065414,0.2614016,0.008819663,0.0008845738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.261778,0.00006835662,0.7284241,0.001720133,0.0002017676,0.0008937324,0.0002751848,0.0002739495,0.006364768],"genre_scores_gemma":[0.8680195,0.000004728909,0.130161,0.001399384,0.00002754708,0.00003136407,0.00004537237,0.000006000887,0.0003051525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6808417,"threshold_uncertainty_score":0.4645078,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02818208505514126,"score_gpt":0.2811274377430031,"score_spread":0.2529453526878619,"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."}}