Author:
Blanchet-Sadri F.,Ji Steven,Reiland Elizabeth
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Efficient string machines, an aid to bibliographic research;Aho;Communications of the ACM,1975
2. On the complexity of deciding avoidability of sets of partial words;Blakeley;Theoretical Computer Science,2010
3. Unavoidable sets of partial words;Blanchet-Sadri;Theory of Computing Systems,2009
4. Minimum number of holes in unavoidable sets of partial words of size three;Blanchet-Sadri,2011
5. Testing avoidability on sets of partial words is hard;Blanchet-Sadri;Theoretical Computer Science,2009
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unavoidable Sets of Partial Words of Uniform Length;Electronic Proceedings in Theoretical Computer Science;2017-08-21