Lower Bounds, and Exact Enumeration in Particular Cases, for the Probability of Existence of a Universal Cycle or a Universal Word for a Set of Words

Lower Bounds, and Exact Enumeration in Particular Cases, for the Probability of Existence of a Universal Cycle or a Universal Word for a Set of Words

A universal cycle, or u-cycle, for a given set of words is a circular word that contains each word from the set exactly once as a contiguous subword. The celebrated de Bruijn sequences are a particular case of such a u-cycle, where a set in question is the set <inline-formula> <math display...

Full description

Bibliographic Details
Main Authors: Herman Z. Q. Chen, Sergey Kitaev, Brian Y. Sun
Format: Article
Language:English
Published: MDPI AG 2020-05-01
Series:Mathematics
Subjects:
universal cycle
u-cycle
universal word
u-word
de Bruijn sequence
Online Access:https://www.mdpi.com/2227-7390/8/5/778

Internet

https://www.mdpi.com/2227-7390/8/5/778

Similar Items