{"id":"W2129749965","doi":"10.1016/j.tcs.2010.09.006","title":"On the complexity of deciding avoidability of sets of partial words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Combinatorics on words; Set (abstract data type); Word (group theory); Alphabet; Space (punctuation); Discrete mathematics; Decidability; Finite set; Polynomial; De Bruijn sequence; Time complexity; Upper and lower bounds; Existential quantification; 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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004123408,0.0001372203,0.0002978198,0.0001024369,0.0001732137,0.00005452006,0.003264625,0.00004958059,0.00009243029],"category_scores_gemma":[0.0005093766,0.00008552472,0.000107651,0.0009051813,0.01279935,0.0002289685,0.001044311,0.0002694648,0.000005378557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001216127,"about_ca_system_score_gemma":0.0001167016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009000979,"about_ca_topic_score_gemma":0.000001177104,"domain_scores_codex":[0.9978027,0.0002024782,0.0004602509,0.0004282219,0.000775978,0.0003303403],"domain_scores_gemma":[0.9965345,0.00151897,0.0002204468,0.001390578,0.0002191479,0.0001163386],"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.00001511057,0.0001269057,0.0001568672,0.00001224735,0.000003287799,5.880839e-7,0.0005464138,0.00003927339,0.02163068,0.9691014,0.000008401254,0.008358792],"study_design_scores_gemma":[0.00009140075,0.0001510723,0.00342838,0.0000277785,0.000002423701,0.000003994021,0.000007850571,0.2391452,0.1911187,0.5659487,0.000002906835,0.00007155546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6015775,0.000002438624,0.3967823,0.0004587744,0.0003254914,0.0001017601,0.000003375635,0.00002741419,0.0007210332],"genre_scores_gemma":[0.9491765,4.010011e-7,0.0506619,0.0001260984,0.00002830786,0.000002412582,1.740209e-7,0.000003686575,5.15443e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4031527,"threshold_uncertainty_score":0.9898872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02540349965560846,"score_gpt":0.2698010805531539,"score_spread":0.2443975808975454,"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."}}