Upper bound for the number of privileged words

被引：0

|

作者：

Rukavicka, Josef ^{[1
]}

机构：

[1] Department of Mathematics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University, Prague, Czech Republic

来源：

arXiv | 2022年

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[21] AN UPPER BOUND FOR THE AVERAGE NUMBER OF REGIONS
STAHL, S
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1991, 52 (02) : 219 - 221
[22] An upper bound for the number of reachable positions
Chinchalkar, S
ICCA JOURNAL, 1996, 19 (03): : 181 - 183
[23] AN UPPER BOUND FOR THE TOTAL CHROMATIC NUMBER
HIND, HR
GRAPHS AND COMBINATORICS, 1990, 6 (02) : 153 - 159
[24] An Upper Bound on the Burning Number of Graphs
Land, Max R.
Lu, Linyuan
ALGORITHMS AND MODELS FOR THE WEB GRAPH, WAW 2016, 2016, 10088 : 1 - 8
[25] Improving the Upper Bound on the Length of the Shortest Reset Words
Szykula, Marek
35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
[26] UPPER BOUND FOR PALINDROMIC AND FACTOR COMPLEXITY OF RICH WORDS
Rukavicka, Josef
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2021, 55
[27] Upper bound for palindromic and factor complexity of rich words
Rukavicka, Josef
RAIRO - Theoretical Informatics and Applications, 2021, 55
[28] An Improved Lower Bound on the Number of Ternary Squarefree Words
Sollami, Michael
Douglas, Craig C.
Liebman, Manfred
JOURNAL OF INTEGER SEQUENCES, 2016, 19 (06)
[29] Considering a Classical Upper Bound on the Frobenius Number
Williams, Aled
Haijima, Daiki
MATHEMATICS, 2024, 12 (24)
[30] Upper bound for the number of independent sets in graphs
A. A. Sapozhenko
Doklady Mathematics, 2007, 75 : 447 - 448

← 1 2 3 4 5 →