{"id":"W2084802325","doi":"10.1016/j.ejc.2007.01.002","title":"Characterizations of finite and infinite episturmian words via lexicographic orderings","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Lexicographical order; Mathematics; Alphabet; Finite set; Combinatorics on words; Order (exchange); Characterization (materials science); Combinatorics; Skew; Set (abstract data type); Infinite set; Infinite product; Discrete mathematics; Word (group theory); Mathematical analysis; Linguistics; Computer science","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.0008346424,0.0005351999,0.0006382783,0.002581707,0.001780982,0.004519996,0.0008336048,0.001038012,0.007095125],"category_scores_gemma":[0.003776945,0.0005607549,0.0007749183,0.001797156,0.00315544,0.004975653,0.001934592,0.001728935,0.0009735164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008924893,"about_ca_system_score_gemma":0.0005121368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004338548,"about_ca_topic_score_gemma":0.000684883,"domain_scores_codex":[0.9988404,0.0002926103,0.0001379234,0.0002220424,0.0002921694,0.00021487],"domain_scores_gemma":[0.9964142,0.002081755,0.0003798418,0.0002845591,0.000482629,0.0003570287],"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.00006974841,0.00003166286,0.0005340421,0.00004747944,0.000006303158,0.0002084315,0.00082504,0.000482442,0.002977036,0.9874536,0.0005810231,0.006783103],"study_design_scores_gemma":[0.00001993496,0.00003057354,0.0005575838,0.00002903257,0.00001693534,0.0004403978,0.0005175131,0.005701387,0.001850993,0.9855456,0.00525962,0.00003041134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6349702,0.0008247761,0.2455198,0.001442751,0.0002167838,0.0001168165,0.0007896473,0.0006335311,0.1154857],"genre_scores_gemma":[0.9439862,0.0002802535,0.03979655,0.0002845713,0.0002132454,0.00009945399,0.0007984485,0.0001895689,0.01435165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007095125,"threshold_uncertainty_score":0.02373558,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007909369142483323,"score_gpt":0.2068976660720896,"score_spread":0.1989882969296063,"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."}}