{"id":"W32599491","doi":"10.1016/j.media.2020.101758","title":"Operational State Complexity of Prefix-Free Regular Languages.","year":2009,"lang":"en","type":"article","venue":"Automata and Formal Languages","topic":"semigroups and automata theory","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Prefix; Computer science; Regular language; Programming language; State (computer science); Theoretical computer science; Arithmetic; Automaton; Mathematics; Linguistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004256367,0.0008147302,0.0009754429,0.00169096,0.001342789,0.005398957,0.002140658,0.001463355,0.0105263],"category_scores_gemma":[0.02504023,0.0005684294,0.001788621,0.002079272,0.002754615,0.01054417,0.003385857,0.003111636,0.002079521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002123133,"about_ca_system_score_gemma":0.00255721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00189649,"about_ca_topic_score_gemma":0.001697346,"domain_scores_codex":[0.9941825,0.001368804,0.0007887366,0.001375574,0.001462985,0.0008214612],"domain_scores_gemma":[0.9789346,0.01299019,0.001541181,0.003629959,0.002405934,0.0004980403],"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.0003539187,0.0001166814,0.001003575,0.000256781,0.00004766901,0.0002417966,0.0006163904,0.0845644,0.00195919,0.8371114,0.004620107,0.06910811],"study_design_scores_gemma":[0.00002642905,0.00004719447,0.0001122358,0.00003372998,0.00001728113,0.0001228857,0.00009635011,0.2308758,0.001554514,0.7636568,0.003433307,0.00002344239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07172173,0.0005006667,0.9077579,0.001454284,0.0001490226,0.0002260542,0.001716767,0.001950359,0.01452315],"genre_scores_gemma":[0.6935817,0.0004863827,0.2890351,0.0006922963,0.0002708325,0.0006537676,0.003790473,0.0006915252,0.01079786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0105263,"threshold_uncertainty_score":0.03521401,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01221420948249259,"score_gpt":0.2500155339811825,"score_spread":0.23780132449869,"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."}}