{"id":"W1503539558","doi":"10.1007/978-3-540-74456-6_45","title":"State Complexity of Basic Operations on Suffix-Free Regular Languages","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Suffix; State (computer science); Programming language; Theoretical computer science; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001297349,0.0004519265,0.0005465496,0.0008437262,0.0002157034,0.0002770813,0.004448379,0.000199164,0.00003997441],"category_scores_gemma":[0.0001264156,0.0003955367,0.0001413996,0.0005838107,0.001371197,0.0003973375,0.001423254,0.0006100195,0.0000313607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001686615,"about_ca_system_score_gemma":0.0003097199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007798634,"about_ca_topic_score_gemma":0.0002428362,"domain_scores_codex":[0.9966102,0.00005079254,0.0005720456,0.001155441,0.001049028,0.0005625022],"domain_scores_gemma":[0.9964454,0.0004660096,0.0002174144,0.002493779,0.0002313172,0.00014609],"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.00001203981,0.00008915106,0.00001948552,0.00005633508,0.00001985593,0.0001386058,0.001242582,0.03359769,0.0006981783,0.51601,0.00007669743,0.4480393],"study_design_scores_gemma":[0.0005539288,0.0004589666,0.0005437026,0.0006820446,0.00001012709,0.00006567129,9.961686e-7,0.3515376,0.02021579,0.6242055,0.0008077943,0.0009178631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001303009,0.0003667125,0.991647,0.0006584289,0.0007291082,0.0003092011,0.00003492786,0.0001715452,0.004780078],"genre_scores_gemma":[0.2834835,0.00006351069,0.7113037,0.003602141,0.0004842718,0.00000772666,0.00002321584,0.00006668858,0.0009651915],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4471214,"threshold_uncertainty_score":0.9998497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02995933655791481,"score_gpt":0.2700726167175028,"score_spread":0.240113280159588,"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."}}