Now showing items 1-2 of 2

    • Moreno Araya, Eduardo (2005)
      A de Bruijn sequence over a finite alphabet of span n is a cyclic string such that all words of length n appear exactly once as factors of this sequence. We extend this definition to a subset of words of length n, ...
    • Moreno Araya, Eduardo; Matamala Vásquez, Martín (2004)
      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 ...