{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009360135,0.0007084936,0.001229293,0.001292965,0.001391392,0.003973896,0.002198613,0.001374545,0.00615226],"category_scores_gemma":[0.008950838,0.0009686854,0.00118859,0.00307962,0.001487018,0.008665682,0.00327171,0.002524584,0.002178161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001248536,"about_ca_system_score_gemma":0.00180141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001216778,"about_ca_topic_score_gemma":0.003553503,"domain_scores_codex":[0.9977438,0.0007040697,0.0002175998,0.0004274135,0.0004898575,0.0004172876],"domain_scores_gemma":[0.989641,0.00691798,0.0006355838,0.00165703,0.000846389,0.0003020723],"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.0009181323,0.000512511,0.003239534,0.0009701719,0.0001025765,0.0003572838,0.001862301,0.04257799,0.02001184,0.6313822,0.02494774,0.2731177],"study_design_scores_gemma":[0.00007166776,0.00004566938,0.0002812848,0.00005222854,0.00005430028,0.000167898,0.0002727658,0.08503492,0.006069391,0.9004872,0.007435831,0.0000269428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2895422,0.0008971646,0.6697902,0.002916518,0.0001938549,0.0002514082,0.002095501,0.003390248,0.03092291],"genre_scores_gemma":[0.6081366,0.0007130155,0.3596545,0.0007355263,0.0001734101,0.0003558422,0.004812664,0.00123451,0.024184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00615226,"threshold_uncertainty_score":0.02058142,"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."}}