Unavoidable Sets of Words of Uniform Length-Reference-Cited by-同舟云学术

Unavoidable Sets of Words of Uniform Length

Published:2002-03 Issue:2 Volume:173 Page:222-226
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Saker C.J.,Higgins P.M.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference8 articles.

1. On extendability of unavoidable sets;Choffrut;Discr. Appl. Math.,1984

2. An optimal test on finite unavoidable sets of words;Crochemore;Inform. Proc. Lett.,1983

3. Lothaire, M. 1983, “Combinatorics on Words”, Encyclopedia of Mathematics and Its Applications, Vol, 17, Addison-Wesley, Reading, MA. Reprinted in the, Cambridge Mathematical Library, Cambridge University Press, Cambridge, UK, 1997.

4. Lothaire, M. 2000, Algebraic Combinatorics on Words. Available at, http://www-igm.univ-mlv.fr/~berstel/Lothaire/.

5. Niven, I, Zuckerman, H. S, and, Montgomery, H. L. 1960, An Introduction to the Theory of Numbers, Wiley, New York.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Creating and Using Minimizer Sketches in Computational Genomics;Journal of Computational Biology;2023-12-01

2. Unavoidable Sets of Partial Words of Uniform Length;Electronic Proceedings in Theoretical Computer Science;2017-08-21

3. Number of holes in unavoidable sets of partial words II;Journal of Discrete Algorithms;2012-07

4. Number of holes in unavoidable sets of partial words I;Journal of Discrete Algorithms;2012-07

5. Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three;Lecture Notes in Computer Science;2011