Add to ORKGArtículo de publicaciónLet 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
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
AbstractGiven a digraph (directed graph) with a labeling on its arcs, we study the problem of findin...
Artículo de publicaciónLet be the following strategy to construct a walk in a labeled digraph: at ea...
Given a digraph (directed graph) with a labeling on its arcs, we study the problem of finding the Eu...
AbstractGiven a digraph (directed graph) with a labeling on its arcs, we study the problem of findin...
Let be a language composed by all words of a given length $n$. A de Bruijn sequence of span $n$ is a...
Let be a language composed by all words of a given length $n$. A de Bruijn sequence of span $n$ is a...
Soit un langage composée par tous les mots d une longueur donnée n. Un cycle de de Bruijn d ordre n ...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
Let G = (V, A) be an Eulerian directed graph with an arc-labeling. In this work we study the problem...
Let G = (V, A) be an Eulerian directed graph with an arc-labeling. In this work we study the problem...
Abstract. Let G = (V, A) be an Eulerian directed graph with an arclabeling. In this work we study th...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
AbstractGiven a digraph (directed graph) with a labeling on its arcs, we study the problem of findin...
Artículo de publicaciónLet be the following strategy to construct a walk in a labeled digraph: at ea...
Given a digraph (directed graph) with a labeling on its arcs, we study the problem of finding the Eu...
AbstractGiven a digraph (directed graph) with a labeling on its arcs, we study the problem of findin...
Let be a language composed by all words of a given length $n$. A de Bruijn sequence of span $n$ is a...
Let be a language composed by all words of a given length $n$. A de Bruijn sequence of span $n$ is a...
Soit un langage composée par tous les mots d une longueur donnée n. Un cycle de de Bruijn d ordre n ...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
Let G = (V, A) be an Eulerian directed graph with an arc-labeling. In this work we study the problem...
Let G = (V, A) be an Eulerian directed graph with an arc-labeling. In this work we study the problem...
Abstract. Let G = (V, A) be an Eulerian directed graph with an arclabeling. In this work we study th...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of leng...
AbstractGiven a digraph (directed graph) with a labeling on its arcs, we study the problem of findin...