|
|||||
|
|
Super-stationary set, subword problem and the complexity |
|
| Authors: | Teturo Kamae Hui Rao |
| Institution: | a Matsuyama University, 790-8578, Japan b Department of Mathematics, Tsinghua University, Beijing 100084, PR China c Department of Mathematics, Huazhong University of Science and Technology, Wuhan 430074, PR China d Department of Mathematics and LMIB, Beijing University of Aeronautics and Astronautics, Beijing 10083, PR China |
| Abstract: | Let Ω⊂{0,1}N be a nonempty closed set with N={0,1,2,…}. For N={N0<N1<N2<?}⊂N and ω∈{0,1}N, define ωN]∈{0,1}N by  and  |
| Keywords: | Uniform set Super-stationary set Complexity Super-subword |
| 本文献已被 ScienceDirect 等数据库收录！ | |