{"id":"W2087402722","doi":"10.1007/978-3-642-31606-7_16","title":"Automatic Theorem-Proving in Combinatorics on Words","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Shuffling; Combinatorics on words; Computer science; Automaton; Function (biology); Combinatorics; Computation; Discrete mathematics; Extremal combinatorics; Algorithm; Mathematics; Theoretical computer science; Word (group theory); Programming language","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.002584721,0.001516243,0.001504226,0.003065315,0.002452268,0.006257291,0.003539902,0.00153911,0.01195758],"category_scores_gemma":[0.007961799,0.001736027,0.002954492,0.003908093,0.007699366,0.01595012,0.004255712,0.005124249,0.003247579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002766754,"about_ca_system_score_gemma":0.001351585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000958395,"about_ca_topic_score_gemma":0.0009322198,"domain_scores_codex":[0.9965901,0.001365951,0.0002856107,0.0004656169,0.001034065,0.0002586792],"domain_scores_gemma":[0.9921029,0.006320654,0.0001686179,0.0008509386,0.0004183107,0.000138526],"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.0000312626,0.00002813925,0.0001374589,0.0003362527,0.0000275972,0.00007871395,0.0003489818,0.001897859,0.0007410312,0.9601866,0.004654311,0.03153167],"study_design_scores_gemma":[0.000008735426,0.000006440927,0.00005453449,0.00004175085,0.00001206958,0.00004932159,0.00002812847,0.002669499,0.0006477181,0.9860064,0.01046505,0.00001024033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02412369,0.009850468,0.8040754,0.004202898,0.001374921,0.0001868647,0.0004215269,0.001831518,0.1539327],"genre_scores_gemma":[0.5521667,0.01020117,0.3647658,0.001131936,0.002826098,0.00047121,0.001450831,0.001324912,0.0656613],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01195758,"threshold_uncertainty_score":0.04000211,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0130593615674536,"score_gpt":0.2308174175266998,"score_spread":0.2177580559592462,"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."}}