Author:
Blanchet-Sadri F.,De Winkle Benjamin,Simmons Sean
Subject
Computer Science Applications,General Mathematics,Software
Reference18 articles.
1. Berstel J. and Boasson L., Partial words and a theorem of Fine and Wilf.Theoret. Comput. Sci.218(1999) 135–141.
2. F. Blanchet-Sadri,Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton, FL (2008).
3. F. Blanchet-Sadri and S. Simmons, Abelian pattern avoidance in partial words, inMFCS 2012, 37th International Symposium on Mathematical Foundations of Computer Science. Edited by B. Rovan, V. Sassone and P. Widmayer. Vol. 7464 ofLect. Notes Comput. Sci.Springer-Verlag, Berlin (2012) 210–221.
4. Blanchet-Sadri F., Kim J.I., Mercaş R., Severa W., Simmons S. and Xu D., Avoiding abelian squares in partial words.J. Combin. Theory, Ser. A119(2012) 257–270.
5. Blanchet-Sadri F., Lohr A. and Scott S., Computing the partial word avoidability indices of binary patterns.J. Discrete Algorithms23(2013) 113–118
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast algorithms for Abelian periods in words and greatest common divisor queries;Journal of Computer and System Sciences;2017-03
2. Computing Depths of Patterns;RAIRO - Theoretical Informatics and Applications;2016-04