Title

Classifying Rotationally-Closed Languages Having Greedy Universal Cycles

School/Department

School of Science Technology and Health

Publication Date

3-8-2019

Abstract

Let T(n,k)" role="presentation">T(n,k) be the set of strings of length n" role="presentation">n over the alphabet Σ={1,2,…,k}" role="presentation">Σ={1,2,…,k}. A universal cycle for T(n,k)" role="presentation">T(n,k) can be constructed using a greedy algorithm: start with the string kn" role="presentation">kn, and continually append the least symbol possible without repeating a substring of length n" role="presentation">n. This construction also creates universal cycles for some subsets S⊆T(n,k)" role="presentation">S⊆T(n,k); we will classify all such subsets that are closed under rotations.

Publication Title

The Electronic Journal of Combinatorics

Volume

26

Issue

1

DOI of Published Version

10.37236/7932

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Share

COinS