Minimal de bruijn sequence in a language with forbidden substrings

Authors:
Eduardo Moreno;Martín Matamala
Affiliations:
Departamento de Ingeniería Matemática, Facultad de Ciencias Físicas y Matemáticas, Universidad de Chile, Santiago, Chile;Departamento de Ingeniería Matemática, Facultad de Ciencias Físicas y Matemáticas, Universidad de Chile, Santiago, Chile
Venue:
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Year:
2004

Citing 4
Cited 1

Generating necklaces

Journal of Algorithms
Universal cycles for combinatorial structures

Discrete Mathematics
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Generating Necklaces and Strings with Forbidden Substrings

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics

Minimal eulerian circuit in a labeled digraph

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

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.