Author:
Blanchet-Sadri Francine,Woodhouse Brent
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Bell, J., Goh, T.L.: Exponential lower bounds for the number of words of uniform length avoiding a pattern. Information and Computation 205, 1295–1306 (2007)
2. Lecture Notes in Computer Science;F. Blanchet-Sadri,2012
3. Blanchet-Sadri, F., Mercaş, R., Simmons, S., Weissenstein, E.: Avoidable binary patterns in partial words. Acta Informatica 48, 25–41 (2011)
4. Cassaigne, J.: Motifs évitables et régularités dans les mots. Ph.D. thesis, Paris VI (1994)
5. Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strict bounds for pattern avoidance;Theoretical Computer Science;2013-09