Minimum de Bruijn Sequence in a Language with Forbidden Substrings

Details Minimum de Bruijn Sequence in a Language with Forbidden Substrings Minimum de Bruijn Sequence in a Language with Forbidden Substrings

2007-11-12

arxiv.org/abs/0711.1695v1

Mathematics

Combinatorics

Scientific paper

Let be the following strategy to construct a walk in a labeled digraph: at
each vertex, we follow the unvisited arc of minimum label. In this work we
study for which languages, applying the previous strategy over the
corresponding de Bruijn graph, we finish with an Eulerian cycle, in order to
obtain the minimal de Bruijn sequence of the language.

Affiliated with

Also associated with

No associations

Rating

Minimum de Bruijn Sequence in a Language with Forbidden Substrings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimum de Bruijn Sequence in a Language with Forbidden Substrings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum de Bruijn Sequence in a Language with Forbidden Substrings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-128281