Author:
Blanchet-Sadri Francine,Black Kevin,Zemke Andrew
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)
2. Bean, D.R., Ehrenfeucht, A., McNulty, G.: Avoidable patterns in strings of symbols. Pacific Journal of Mathematics 85, 261–294 (1979)
3. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton (2008)
4. Blanchet-Sadri, F., Mercaş, R., Simmons, S., Weissenstein, E.: Avoidable binary patterns in partial words. Acta Informatica 48, 25–41 (2011)
5. Cassaigne, J.: Unavoidable binary patterns. Acta Informatica 30, 385–395 (1993)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Square-Free Partial Words with Many Wildcards;International Journal of Foundations of Computer Science;2018-08
2. Computing Depths of Patterns;RAIRO - Theoretical Informatics and Applications;2016-04
3. Ternary Square-Free Partial Words with Many Wildcards;Developments in Language Theory;2016
4. 5-Abelian cubes are avoidable on binary alphabets;RAIRO - Theoretical Informatics and Applications;2014-07-31
5. Computing Depths of Patterns;Language and Automata Theory and Applications;2014