-
Asymptotic bounds for the number of closed and privileged words
D. Gabric
Submitted manuscript (2023).
-
Ranking and unranking bordered and unbordered words
D. Gabric
Information Processing Letters, to appear (2023).
-
Smallest and Largest Block Palindrome Factorizations
D. Gabric and J. Shallit
14th International Conference on WORDS, LNCS 13899 (2023) 181-191.
Presented at WORDS 2023.
-
Mutual borders and overlaps
D. Gabric
IEEE Transactions on Information Theory, Vol. 68 (2022) 6888-6893.
-
Words that almost commute
D. Gabric
Discrete Mathematics, Vol. 345 No. 7 (2022) 112898.
-
Investigating the discrepancy property of de Bruijn sequences
D. Gabric and J. Sawada
Discrete Mathematics, Vol. 345 No. 4 (2022) 112780.
-
An inequality for the number of periods in a word
D. Gabric, J. Shallit, and N. Rampersad
Interational Journal of Foundations of Computer Science, Vol. 32 No. 05 (2021) 597-614.
-
The simplest binary word with only three squares
D. Gabric and J. Shallit
RAIRO - Theoretical Informatics and Applications, Vol. 55 No. 3 (2021) 1-7.
-
Avoidance of split overlaps
D. Gabric, J. Shallit, and X. F. Zhong
Discrete Mathematics, Vol. 344 No. 2 (2021) 112176.
-
Maximal state complexity and generalized de Bruijn words
D. Gabric, Š. Holub, and J. Shallit
Information and Computation, (2021) 104689.
-
Borders, palindrome prefixes, and square prefixes
D. Gabric and J. Shallit
Information Processing Letters, Vol. 165 (2021) 106027.
-
Circularly squarefree words and unbordered conjugates: A new approach
T. Clokie, D. Gabric, and J. Shallit
12th International Conference on WORDS, LNCS 11682 (2019) 133-144.
Presented at WORDS 2019.
-
Generalized de Bruijn words and the state complexity of conjugate sets
D. Gabric, Š. Holub, and J. Shallit
21st International Conference on Descriptional Complexity of Formal Systems, LNCS 11612 (2019) 137-146.
Presented at DCFS 2019.
-
A successor rule framework for constructing k-ary de Bruijn sequences and universal cycles
D. Gabric, J. Sawada, A. Williams, and D. Wong
IEEE Transactions on Information Theory, Vol. 66 (2019) 679-687.
-
A framework for constructing de Bruijn sequences via simple successor rules
D. Gabric, J. Sawada, A. Williams, and D. Wong
Discrete Mathematics, Vol. 341 No. 11 (2018) 2977-2987.
-
Constructing de Bruijn sequences by concatenating smaller universal cycles
D. Gabric and J. Sawada
Theoretical Computer Science, Vol. 743 (2018) 12-22.
-
A de Bruijn sequence construction by concatenating cycles of the
complemented cycling register
D. Gabric and J. Sawada
11th International Conference on WORDS, LNCS 10432 (2017) 49-58.
Presented at WORDS 2017.
|