Author:
Blakeley Brandon,Blanchet-Sadri F.,Gunter Josh,Rampersad Narad
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. Efficient string machines, an aid to bibliographic research;Aho;Comm. ACM,1975
2. On the complexity of deciding avoidability of sets of partial words;Blakeley,2009
3. Algorithmic Combinatorics on Partial Words;Blanchet-Sadri,2008
4. Unavoidable sets of partial words;Blanchet-Sadri;Theoret. Comput. Syst.,2009
5. Testing avoidability on sets of partial words is hard;Blanchet-Sadri;Theoret. Comput. Sci.,2009
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computational and Proof Complexity of Partial String Avoidability;ACM Transactions on Computation Theory;2021-03
2. Unavoidable Sets of Partial Words of Uniform Length;Electronic Proceedings in Theoretical Computer Science;2017-08-21
3. On universal partial words;Electronic Notes in Discrete Mathematics;2017-08
4. Weak containment for partial words is coNP-complete;Information Processing Letters;2016-02
5. Number of holes in unavoidable sets of partial words II;Journal of Discrete Algorithms;2012-07