-
Constructing k-ary orientable sequences with asymptotically optimal length
D. Gabrić and J. Sawada
Designs, Codes and Cryptography, Vol. 93 (2025) 2349–2367
-
Asymptotic bounds for the number of closed and privileged words
D. Gabrić
Electronic Journal of Combinatorics, Vol. 32 (2024) #P2.45
-
Ranking and unranking bordered and unbordered words
D. Gabrić
Information Processing Letters, Vol. 184 (2024) 106452
-
Mutual borders and overlaps
D. Gabrić
IEEE Transactions on Information Theory, Vol. 68 (2022) 6888-6893
-
Words that almost commute
D. Gabrić
Discrete Mathematics, Vol. 345 No. 7 (2022) 112898
-
Investigating the discrepancy property of de Bruijn sequences
D. Gabrić and J. Sawada
Discrete Mathematics, Vol. 345 No. 4 (2022) 112780
-
An inequality for the number of periods in a word
D. Gabrić, N. Rampersad, and J. Shallit
International Journal of Foundations of Computer Science, Vol. 32 No. 05 (2021) 597-614
-
The simplest binary word with only three squares
D. Gabrić and J. Shallit
RAIRO - Theoretical Informatics and Applications, Vol. 55 No. 3 (2021) 1-7
-
Avoidance of split overlaps
D. Gabrić, J. Shallit, and X. F. Zhong
Discrete Mathematics, Vol. 344 No. 2 (2021) 112176
-
Maximal state complexity and generalized de Bruijn words
D. Gabrić, Š. Holub, and J. Shallit
Information and Computation, (2021) 104689
-
Borders, palindrome prefixes, and square prefixes
D. Gabrić and J. Shallit
Information Processing Letters, Vol. 165 (2021) 106027
-
A successor rule framework for constructing k-ary de Bruijn sequences and universal cycles
D. Gabrić, 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. Gabrić, 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. Gabrić and J. Sawada
Theoretical Computer Science, Vol. 743 (2018) 12-22
