A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register. - Daniel Gabric; Joe Sawada (WORDS, 2017)

A framework for constructing de Bruijn sequences via simple successor rules. - Daniel Gabric; Joe Sawada; Aaron Williams 001; Dennis Wong (Discret. Math., 2018)

Constructing de Bruijn sequences by concatenating smaller universal cycles. - Daniel Gabric; Joe Sawada (Theor. Comput. Sci., 2018)

Circularly Squarefree Words and Unbordered Conjugates: A New Approach. - Trevor Clokie; Daniel Gabric; Jeffrey O. Shallit (WORDS, 2019)

Generalized de Bruijn Words and the State Complexity of Conjugate Sets. - Daniel Gabric; Stepan Holub; Jeffrey O. Shallit (DCFS, 2019)

Avoidance of split overlaps. - Daniel Gabric; Jeffrey O. Shallit (CoRR, 2020)

A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles. - Daniel Gabric; Joe Sawada; Aaron Williams 001; Dennis Wong (IEEE Trans. Inf. Theory, 2020)

Avoidance of split overlaps. - Daniel Gabric; Jeffrey O. Shallit; Xiaofeng Zhong (Discret. Math., 2021)

An Inequality for the Number of Periods in a Word. - Daniel Gabric; Narad Rampersad; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2021)

Borders, palindrome prefixes, and square prefixes. - Daniel Gabric; Jeffrey O. Shallit (Inf. Process. Lett., 2021)

The simplest binary word with only three squares. - Daniel Gabric; Jeffrey O. Shallit (RAIRO Theor. Informatics Appl., 2021)

Words that almost commute. - Daniel Gabric (Discret. Math., 2022)

Investigating the discrepancy property of de Bruijn sequences. - Daniel Gabric; Joe Sawada (Discret. Math., 2022)

Maximal state complexity and generalized de Bruijn words. - Daniel Gabric; Stepan Holub; Jeffrey O. Shallit (Inf. Comput., 2022)

Mutual Borders and Overlaps. - Daniel Gabric (IEEE Trans. Inf. Theory, 2022)

Smallest and Largest Block Palindrome Factorizations. - Daniel Gabric; Jeffrey O. Shallit (WORDS, 2023)

Efficient Construction of Long Orientable Sequences. - Daniel Gabric; Joe Sawada (CPM, 2024)

Asymptotic Bounds for the Number of Closed and Privileged Words. - Daniel Gabric (Electron. J. Comb., 2024)

Ranking and unranking bordered and unbordered words. - Daniel Gabric (Inf. Process. Lett., 2024)

Constructing k-ary orientable sequences with asymptotically optimal length. - Daniel Gabric; Joe Sawada (Des. Codes Cryptogr., 2025)