Two dimensional word with 2k maximal pattern complexity

被引:0
|
作者
Kamae, T [1 ]
Xue, YM [1 ]
机构
[1] Osaka City Univ, Osaka 5588585, Japan
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:257 / 265
页数:9
相关论文
共 50 条
  • [41] 使用符号“[2kπ-π/2,2kπ+π/2](k∈Z)”的一点建议
    王殿明
    [J]. 数学教学, 1994, (01) : 27 - 27
  • [42] On a family of diophantine triples {k, A2k + 2A, (A + 1)2k + 2 (A + 1)} with two parameters
    B. He
    A. Togbé
    [J]. Acta Mathematica Hungarica, 2009, 124 : 99 - 113
  • [43] ON B(2K)-SEQUENCES
    HELM, M
    [J]. ACTA ARITHMETICA, 1993, 63 (04) : 367 - 371
  • [44] On the Lifts of F (2K
    Cayir, Hasim
    Jabrailzade, Fidan
    [J]. INTERNATIONAL ELECTRONIC JOURNAL OF GEOMETRY, 2019, 12 (01): : 71 - 84
  • [45] Management of environments in 2K
    Carvalho, D
    Kon, F
    Ballesteros, F
    Roman, M
    Campbell, R
    Mickunas, D
    [J]. SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2000, : 479 - 485
  • [46] An overview of the manufacturers of two-component (2K) dispensing systems
    [J]. Adhaesion Kleben und Dichten, 2019, 63 (06): : 36 - 41
  • [47] A Simple Computation of ζ (2k)
    Ciaurri, Oscar
    Navas, Luis M.
    Ruiz, Francisco J.
    Varona, Juan L.
    [J]. AMERICAN MATHEMATICAL MONTHLY, 2015, 122 (05): : 444 - 451
  • [48] On the complexity of pattern matching for highly compressed two-dimensional texts
    Berman, P
    Karpinski, M
    Larmore, LL
    Plandowski, W
    Rytter, W
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 65 (02) : 332 - 350
  • [49] On the complexity of pattern matching for highly compressed two-dimensional texts
    Berman, P
    Karpinski, M
    Larmore, LL
    Plandowski, W
    Rytter, W
    [J]. COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 1997, 1264 : 40 - 51
  • [50] Periodic sequences with maximal linear complexity and almost maximal k-error linear complexity
    Niederreiter, H
    Shparlinski, IE
    [J]. CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2003, 2898 : 183 - 189