{"id":"W3169850973","doi":"10.1142/s0129054121420028","title":"Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lexicographical order; Regular language; Mathematics; State (computer science); Combinatorics; Word (group theory); Discrete mathematics; Computer science; Automaton; Artificial intelligence; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.001323918,0.00008670634,0.0001758564,0.0006864381,0.00008561063,0.0004326793,0.001594827,0.00002737649,0.000007945368],"category_scores_gemma":[0.0002151416,0.00008220135,0.00006606272,0.0009797541,0.0002903425,0.001108548,0.0005629833,0.0001531326,8.303572e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004746522,"about_ca_system_score_gemma":0.0003323632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001464052,"about_ca_topic_score_gemma":0.00001631914,"domain_scores_codex":[0.9983323,0.00006703242,0.0005377183,0.0002370221,0.0006679937,0.0001579826],"domain_scores_gemma":[0.9980848,0.0002682061,0.0003880581,0.0002170549,0.0009658015,0.00007610061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001757183,0.0003133932,0.03504903,0.00001949919,0.00009506156,0.0004386758,0.003667397,0.003851103,0.01606645,0.239459,0.00004589292,0.7009769],"study_design_scores_gemma":[0.002911924,0.000369831,0.3788392,0.001839646,0.00002565728,0.004073022,0.001058336,0.4879476,0.03111357,0.09017645,0.0009018235,0.0007429093],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5214005,0.0001718219,0.4760808,0.001561971,0.0005985225,0.00001977,6.857447e-7,0.000009239744,0.000156717],"genre_scores_gemma":[0.7888292,0.00004966511,0.2108567,0.0001610485,0.00009502386,2.267452e-7,7.574066e-7,0.000002531198,0.000004843437],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.700234,"threshold_uncertainty_score":0.4172336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01254001006617158,"score_gpt":0.2983123553723818,"score_spread":0.2857723453062103,"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."}}