Two dimensional word with 2k maximal pattern complexity

被引：0
|
作者：
Kamae, T [1 ]
Xue, YM [1 ]
机构：
[1] Osaka City Univ, Osaka 5588585, Japan
来源：
OSAKA JOURNAL OF MATHEMATICS | 2004年 / 41卷 / 02期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：257 / 265
页数：9
相关论文
共 50 条
  • [1] Maximal pattern complexity of two-dimensional words
    Kamae, Teturo
    Rao, Hui
    Xue, Yu-Mei
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 359 (1-3) : 15 - 27
  • [2] Maximal pattern complexity of higher dimensional words
    Qu, Yan-hui
    Rao, Hui
    Wen, Zhi-ying
    Xue, Yu-mei
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2010, 117 (05) : 489 - 506
  • [3] Word 2K超级符号栏
    江汉浪子
    [J]. 网络与信息, 2002, (10) : 42 - 43
  • [4] Integrable (2k)-Dimensional Hitchin Equations
    R. S. Ward
    [J]. Letters in Mathematical Physics, 2016, 106 : 951 - 958
  • [5] Integrable (2k)-Dimensional Hitchin Equations
    Ward, R. S.
    [J]. LETTERS IN MATHEMATICAL PHYSICS, 2016, 106 (07) : 951 - 958
  • [6] 2K x 2K InSb for astronomy
    Hoffman, AW
    Corrales, E
    Love, PJ
    Rosbeck, J
    Merrill, M
    Fowler, A
    McMurtry, C
    [J]. OPTICAL AND INFRARED DETECTORS FOR ASTRONOMY, 2004, 5499 : 59 - 67
  • [7] The power of two … 2K factorial experiments
    Heather K. Shelton
    [J]. Experimental Techniques, 2004, 28 : 41 - 43
  • [8] The power of two ... 2K factorial experiments
    Shelton, HK
    [J]. EXPERIMENTAL TECHNIQUES, 2004, 28 (01) : 41 - 43
  • [9] THE COMPLEXITY OF COMPUTING MAXIMAL WORD FUNCTIONS
    BRUSCHI, D
    PIGHIZZINI, G
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 157 - 167
  • [10] A generalized method for constructing subquadratic complexity GF(2k) multipliers
    Sunar, B
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (09) : 1097 - 1105
12345