{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00699004,0.00143028,0.003668854,0.002190736,0.003923735,0.01405722,0.005383687,0.004445937,0.01526596],"category_scores_gemma":[0.06360253,0.002028043,0.004911249,0.003787729,0.007270552,0.02772638,0.006919493,0.008949189,0.0009775488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006509864,"about_ca_system_score_gemma":0.005929846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009719081,"about_ca_topic_score_gemma":0.01164559,"domain_scores_codex":[0.9873871,0.003768644,0.001065876,0.002452238,0.003484279,0.001841877],"domain_scores_gemma":[0.7628587,0.2198329,0.005083963,0.006088544,0.002823072,0.003312882],"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.008064088,0.001576843,0.01904813,0.002271704,0.001028234,0.001725435,0.004542002,0.2656478,0.009796284,0.5659232,0.0220642,0.09831208],"study_design_scores_gemma":[0.0004432144,0.0001402474,0.001590509,0.00005591794,0.0001968018,0.0002976782,0.0006617212,0.2036054,0.001875031,0.7896697,0.001385241,0.00007852246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.782142,0.001613949,0.1627301,0.01772296,0.0003601825,0.0005397255,0.003806922,0.001611338,0.0294728],"genre_scores_gemma":[0.9427567,0.0007375228,0.04451127,0.0009423399,0.0006333464,0.0003063326,0.003924417,0.0004240562,0.005764101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01526596,"threshold_uncertainty_score":0.05106974,"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."}}