Computing the partial word avoidability indices of binary patterns

Journal of Discrete Algorithms - Tập 23 - Trang 113-118 - 2013
F. Blanchet-Sadri1, Andrew Lohr2, Shane Scott3
1Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402-6170, USA
2Department of Mathematics, Mathematics Building, University of Maryland, College Park, MD 20742, USA
3School of Mathematics, Georgia Institute of Technology, 686 Cherry Street, Atlanta, GA 30332-0160, USA

Tài liệu tham khảo

Bean, 1979, Avoidable patterns in strings of symbols, Pacific Journal of Mathematics, 85, 261, 10.2140/pjm.1979.85.261 Blanchet-Sadri, 2008 Blanchet-Sadri, 2011, Avoidable binary patterns in partial words, Acta Informatica, 48, 25, 10.1007/s00236-010-0129-0 Blanchet-Sadri, 2012, Computing the partial word avoidability indices of ternary patterns, vol. 7643, 206 Blanchet-Sadri, 2012, Erratum to: Avoidable binary patterns in partial words, Acta Informatica, 49, 53, 10.1007/s00236-011-0149-4 Lothaire, 1997 Lothaire, 2002 Zimin, 1984, Blocking sets of terms, Mathematics of the USSR. Sbornik, 47, 353, 10.1070/SM1984v047n02ABEH002647
Thông tin
Thông tin xuất bản

Journal of Discrete Algorithms

Tập 23

113-118

Thông tin tác giả