Daniel Gabric

Inf. Process. Lett., February, 2024

Constructing k-ary Orientable Sequences with Asymptotically Optimal Length.

[BibT_eX]

[DOI]

CoRR, 2024

Asymptotic Bounds for the Number of Closed and Privileged Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Efficient Construction of Long Orientable Sequences.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

Smallest and Largest Block Palindrome Factorizations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

Mutual Borders and Overlaps.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Maximal state complexity and generalized de Bruijn words.

[BibT_eX]

[DOI]

Stepan Holub

Inf. Comput., 2022

Investigating the discrepancy property of de Bruijn sequences.

[BibT_eX]

[DOI]

Discret. Math., 2022

Words that almost commute.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

The simplest binary word with only three squares.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2021

Borders, palindrome prefixes, and square prefixes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

An Inequality for the Number of Periods in a Word.

[BibT_eX]

[DOI]

Narad Rampersad

Int. J. Found. Comput. Sci., 2021

Avoidance of split overlaps.

[BibT_eX]

[DOI]

Xiaofeng Zhong

Discret. Math., 2021

2020

A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Avoidance of split overlaps.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Generalized de Bruijn Words and the State Complexity of Conjugate Sets.

[BibT_eX]

[DOI]

Stepan Holub

Proceedings of the Descriptional Complexity of Formal Systems, 2019

Circularly Squarefree Words and Unbordered Conjugates: A New Approach.

[BibT_eX]

[DOI]

Trevor Clokie

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

Constructing de Bruijn sequences by concatenating smaller universal cycles.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

A framework for constructing de Bruijn sequences via simple successor rules.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register.

[BibT_eX]

[DOI]