Minimal de bruijn sequence in a language with forbidden substrings

Eduardo Moreno, Martín Matamala

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

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.

Fingerprint

Dive into the research topics of 'Minimal de bruijn sequence in a language with forbidden substrings'. Together they form a unique fingerprint.

Cite this