Author:
Blanchet-Sadri F.,Chen Bob,Chakarov Aleksandar
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Algorithmic Combinatorics on Partial Words;Blanchet-Sadri,2008
2. Unavoidable sets of partial words;Blanchet-Sadri;Theory of Computing Systems,2009
3. Classifying all avoidable sets of partial words of size two;Blanchet-Sadri,2010
4. Minimum number of holes in unavoidable sets of partial words of size three;Blanchet-Sadri,2011
5. Unavoidable sets of constant length;Champarnaud;International Journal of Algebra and Computation,2004
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unavoidable Sets of Partial Words of Uniform Length;Electronic Proceedings in Theoretical Computer Science;2017-08-21