Sciweavers

WG
2004
Springer

Minimal de Bruijn Sequence in a Language with Forbidden Substrings

14 years 5 months ago
Minimal de Bruijn Sequence in a Language with Forbidden Substrings
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.
Eduardo Moreno, Martín Matamala
Added 03 Jul 2010
Updated 03 Jul 2010
Type Conference
Year 2004
Where WG
Authors Eduardo Moreno, Martín Matamala
Comments (0)