{"id":"W1996328142","doi":"10.1016/j.tcs.2009.03.018","title":"Efficient enumeration of words in regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Lexicographical order; Mathematics; Computation; Domain (mathematical analysis); Algorithm; Combinatorics; Computer science; Discrete mathematics","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.001184558,0.0001089251,0.0001693722,0.0002951838,0.0001178089,0.0001231155,0.001534666,0.0000330007,0.00001257471],"category_scores_gemma":[0.00005614732,0.00009384821,0.00004820167,0.001703631,0.001055999,0.0001787287,0.0003041484,0.0001306328,0.000007500284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003207929,"about_ca_system_score_gemma":0.00006090321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003521111,"about_ca_topic_score_gemma":5.918114e-7,"domain_scores_codex":[0.9983379,0.00007725384,0.0002616177,0.0004294007,0.0005548821,0.0003389725],"domain_scores_gemma":[0.9990577,0.0001045003,0.00005491094,0.0005983989,0.00008759129,0.00009687795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002976469,0.00008769683,0.00003274732,0.000002232134,5.430305e-7,0.000007526544,0.000601493,0.002867345,0.0009986561,0.9065866,0.000003479924,0.08880866],"study_design_scores_gemma":[0.0001452316,0.0001612271,0.005754549,0.00003153952,8.477982e-7,0.00001044884,0.000009184019,0.7984122,0.00579748,0.1895625,0.00000823681,0.0001065735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1829958,0.00004292643,0.8141717,0.0007879559,0.0001614937,0.00008864869,4.457251e-7,0.00006452486,0.00168659],"genre_scores_gemma":[0.8250515,0.000001285805,0.1746982,0.0002073305,0.00003658471,0.000001056551,2.252131e-7,0.00000156418,0.000002215497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7955449,"threshold_uncertainty_score":0.3890871,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006969939814450132,"score_gpt":0.2559353342371161,"score_spread":0.2489653944226659,"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."}}