{"id":"W3010659905","doi":"10.1007/978-3-030-48516-0_7","title":"The State Complexity of Lexicographically Smallest Words and Computing Successors","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lexicographical order; Combinatorics; Mathematics; Alphabet; Word (group theory); State (computer science); Upper and lower bounds; Regular language; Successor cardinal; Discrete mathematics; Finite-state machine; Matching (statistics); Finite set; Algorithm; Automaton; Computer science; Geometry","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.002948217,0.0006897466,0.001715002,0.002975945,0.00191868,0.009603051,0.003016493,0.00214143,0.01185963],"category_scores_gemma":[0.03655278,0.001110643,0.002371674,0.003784543,0.004083782,0.02146669,0.00318485,0.003660836,0.0008541974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003441712,"about_ca_system_score_gemma":0.002599943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003066337,"about_ca_topic_score_gemma":0.003295679,"domain_scores_codex":[0.9957258,0.001034021,0.0004012889,0.0009482867,0.00126221,0.0006283629],"domain_scores_gemma":[0.9298513,0.06019725,0.002258132,0.004433921,0.00192712,0.001332253],"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.001444952,0.0002669326,0.008507467,0.0005856145,0.0001245761,0.0002549137,0.001530066,0.1141447,0.006001544,0.8075461,0.005177465,0.05441559],"study_design_scores_gemma":[0.00003247867,0.00003519788,0.0008469393,0.00003090324,0.00004671797,0.00008403639,0.0001544659,0.162733,0.0022208,0.8330566,0.0007250767,0.00003397113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7065923,0.001401336,0.2581556,0.004638936,0.0001476872,0.0001382203,0.002865274,0.0009211713,0.02513959],"genre_scores_gemma":[0.951663,0.0005658671,0.04033801,0.0001640127,0.0001912747,0.0001361221,0.001678235,0.0002841352,0.004979395],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01185963,"threshold_uncertainty_score":0.0396744,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02779281731127878,"score_gpt":0.2690693866123535,"score_spread":0.2412765693010747,"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."}}