Minimal de Bruijn sequence in a language with forbidden substrings

Author	dc.contributor.author	Moreno Araya, Eduardo	es_CL
Author	dc.contributor.author	Matamala Vásquez, Martín
Admission date	dc.date.accessioned	2014-01-13T12:36:25Z
Available date	dc.date.available	2014-01-13T12:36:25Z
Publication date	dc.date.issued	2004
Cita de ítem	dc.identifier.citation	Graph Theoretic Concepts in Computer Science. 3353, Pages: 168-176. 2004	en_US
Identifier	dc.identifier.issn	0302-9743
Identifier	dc.identifier.uri	https://repositorio.uchile.cl/handle/2250/126206
General note	dc.description	Artículo de publicación	en_US
Abstract	dc.description.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.	en_US
Lenguage	dc.language.iso	en_US	en_US
Type of license	dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Chile	*
Link to License	dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/cl/	*
Título	dc.title	Minimal de Bruijn sequence in a language with forbidden substrings	en_US
Document type	dc.type	Artículo de revista

Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile