Minimum de Bruijn Sequence in a Language with Forbidden Substrings

Simple item page
dc.creatorMoreno, Eduardo
dc.creatorMatamala, Martin
dc.date2007-11-12
dc.date.accessioned2026-07-07T08:42:19Z
dc.date.available2026-07-07T08:42:19Z
dc.descriptionLet 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.
dc.identifierhttps://arxiv.org/abs/0711.1695
dc.identifierhttp://arxiv.org/abs/0711.1695
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141920
dc.subjectCombinatorics
dc.titleMinimum de Bruijn Sequence in a Language with Forbidden Substrings
dc.typetext

Files

Collections

arXiv