Author:
Blanchet-Sadri F.,Brownstein N. C.,Kalcic Andy,Palumbo Justin,Weyand T.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference16 articles.
1. Aho, A.V., Corasick, M.J.: Efficient string machines, an aid to bibliographic research. Commun. ACM 18, 333–340 (1975)
2. Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theor. Comput. Sci. 218, 135–141 (1999)
3. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton (2007)
4. Lecture Notes in Computer Science;F. Blanchet-Sadri,2007
5. Blanchet-Sadri, F., Jungers, R., Palumbo, J.: Testing avoidability of sets of partial words is hard. Preprint
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Universal partial words over non-binary alphabets;Theoretical Computer Science;2018-02
2. Unavoidable Sets of Partial Words of Uniform Length;Electronic Proceedings in Theoretical Computer Science;2017-08-21
3. On universal partial words;Electronic Notes in Discrete Mathematics;2017-08
4. Number of holes in unavoidable sets of partial words II;Journal of Discrete Algorithms;2012-07
5. Number of holes in unavoidable sets of partial words I;Journal of Discrete Algorithms;2012-07