Name
Abstract | ||
|---|---|---|
Let @W@?{0,1}^N be a nonempty closed set with N={0,1,2,...}. For N={N\"0 |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2009.02.001 | Discrete Mathematics |
Keywords | Field | DocType |
complexity,super-stationary set,super-subword,uniform set | Discrete mathematics,Combinatorics,Finite set,Complexity function,Polynomial,Closed set,Stationary set,Derived set,Mathematics | Journal |
Volume | Issue | ISSN |
309 | 13 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.56 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teturo Kamae | 1 | 25 | 5.20 |
| Hui Rao | 2 | 23 | 4.58 |
| Bo Tan | 3 | 22 | 3.89 |
| Yu-Mei Xue | 4 | 15 | 3.32 |