Universal Cycles for Some Combinatorial Objects
A de Bruijn cycle commonly referred to as a universal cycle (u-cycle), is a complete and compact listing of a collection of combinatorial objects. In this paper, we show the power of de Bruijn's original theorem, namely that the cycles bearing his name exist for n-letter words on a k-letter alp...
Main Author: | Campbell, Andre A |
---|---|
Format: | Others |
Published: |
Digital Commons @ East Tennessee State University
2013
|
Subjects: | |
Online Access: | https://dc.etsu.edu/etd/1130 https://dc.etsu.edu/cgi/viewcontent.cgi?article=2330&context=etd |
Similar Items
-
Boolean Space
by: Sun, Tzeng-hsiang
Published: (1965) -
On posets and independence spaces
by: Hua Mao
Published: (2014-04-01) -
Lower Bounds, and Exact Enumeration in Particular
Cases, for the Probability of Existence of a Universal
Cycle or a UniversalWord for a Set ofWords
by: Herman Z.Q. Chen, et al.
Published: (2020-05-01) -
Listing Combinatorial Objects
Published: (2012) -
Cycle Structure and Adjacency Graphs of a Class of LFSRs and a New Family of De Bruijn Cycles
by: Xiaofang Wang, et al.
Published: (2018-01-01)