Skip to main content
Journal Article

Minimal de bruijn sequence in a language with forbidden substrings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3353 168-176
DOI: 10.1007/978-3-540-30559-0_14
6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Moreno, E., & Matamala, M. (2004). Minimal de bruijn sequence in a language with forbidden substrings. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3353, 168–176. https://doi.org/10.1007/978-3-540-30559-0_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free