{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002885936,0.0001354126,0.0001946725,0.00007428681,0.000108851,0.0001004998,0.0006857949,0.00004409393,0.00003943488],"category_scores_gemma":[0.00003217561,0.0001094094,0.00004614773,0.0001326123,0.000113595,0.000932457,0.0002828098,0.00007854982,0.000007563517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008829437,"about_ca_system_score_gemma":0.00002545811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005600393,"about_ca_topic_score_gemma":0.000008804394,"domain_scores_codex":[0.9990082,0.00003876122,0.0002294899,0.0002269946,0.0002356511,0.00026093],"domain_scores_gemma":[0.9991518,0.0000375765,0.00008622801,0.0006114409,0.00003840869,0.00007455238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0000166352,0.000108881,0.0002452654,0.00004214584,0.00002560723,0.00004525787,0.002045221,0.00001427378,0.005314669,0.8120624,0.001685354,0.1783943],"study_design_scores_gemma":[0.005647333,0.001666201,0.5126088,0.0002917755,0.00006034141,0.0007126624,0.001953262,0.1438055,0.08212306,0.2423065,0.007088713,0.001735855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9297104,0.002809972,0.04603039,0.002464471,0.00011365,0.0002949149,0.000167977,0.0007379465,0.01767027],"genre_scores_gemma":[0.9739873,0.00003763723,0.0249672,0.0006232478,0.00003792625,0.000002983662,0.00003204188,0.000005575549,0.0003060531],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5697559,"threshold_uncertainty_score":0.4461585,"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."}}