{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481428,0.0006410449,0.001000504,0.001382607,0.001622578,0.004690788,0.001584997,0.001109392,0.004652574],"category_scores_gemma":[0.01821035,0.0005637318,0.001826994,0.00114443,0.003979903,0.009116131,0.002458619,0.002926717,0.0004194905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002336304,"about_ca_system_score_gemma":0.002067626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001234411,"about_ca_topic_score_gemma":0.001226856,"domain_scores_codex":[0.9960608,0.0007293798,0.0004345238,0.0008101932,0.001280552,0.0006845609],"domain_scores_gemma":[0.9563838,0.0345425,0.002634906,0.003420726,0.002065012,0.0009529662],"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.0008735902,0.0002796858,0.006844654,0.0003581643,0.00009338783,0.0004846706,0.001616183,0.1364782,0.02242806,0.8051473,0.001035707,0.02436044],"study_design_scores_gemma":[0.00004680455,0.000159968,0.001119329,0.00002045363,0.00006023524,0.0002450739,0.0002028311,0.2787619,0.01621176,0.7018655,0.001233651,0.0000725046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7848661,0.0003478136,0.2039018,0.0006500295,0.00004384798,0.0001589841,0.0005974952,0.0003803475,0.00905352],"genre_scores_gemma":[0.968072,0.0001759356,0.02938898,0.00004211106,0.00004458184,0.0001669176,0.0004620747,0.0000936594,0.001553762],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004690788,"threshold_uncertainty_score":0.0169512,"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."}}