Author:
Blanchet-Sadri Francine,Simmons Sean
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science 218, 135–141 (1999)
2. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton, FL (2008)
3. Blanchet-Sadri, F., Kim, J.I., Mercaş, R., Severa, W., Simmons, S., Xu, D.: Avoiding abelian squares in partial words. Journal of Combinatorial Theory, Series A 119, 257–270 (2012)
4. Blanchet-Sadri, F., Simmons, S., Xu, D.: Abelian repetitions in partial words. Advances in Applied Mathematics 48, 194–214 (2012)
5. Currie, J., Linek, V.: Avoiding patterns in the abelian sense. Canadian Journal of Mathematics 53, 696–714 (2001)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast algorithms for Abelian periods in words and greatest common divisor queries;Journal of Computer and System Sciences;2017-03
2. Abelian pattern avoidance in partial words;RAIRO - Theoretical Informatics and Applications;2014-06-10
3. Computing Depths of Patterns;Language and Automata Theory and Applications;2014
4. ALGORITHMIC COMBINATORICS ON PARTIAL WORDS;International Journal of Foundations of Computer Science;2012-09