[1]
DiMuro, J. 2019. Classifying Rotationally-Closed Languages Having Greedy Universal Cycles. The Electronic Journal of Combinatorics. 26, 1 (Mar. 2019), #P1.35. DOI:https://doi.org/10.37236/7932.