Sciweavers

59
Voted
WG
2004
Springer
15 years 2 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, app...
Eduardo Moreno, Martín Matamala