| dc.creator | Moreno Araya, Eduardo | |
| dc.date.accessioned | 2014-01-07T19:41:49Z | |
| dc.date.available | 2014-01-07T19:41:49Z | |
| dc.date.created | 2014-01-07T19:41:49Z | |
| dc.date.issued | 2005 | |
| dc.identifier | Information Processing Letters 96 (2005) 214–219 | |
| dc.identifier | doi:10.1016/j.ipl.2005.05.028 | |
| dc.identifier | https://repositorio.uchile.cl/handle/2250/126018 | |
| dc.description.abstract | 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, characterizing for which subsets exists a de
Bruijn sequence.We also study some symbolic dynamical properties of these subsets extending the definition to a language defined
by forbidden factors. For these kinds of languages we present an algorithm to produce a de Bruijn sequence. In this work we use
graph-theoretic and combinatorial concepts to prove these results. | |
| dc.language | en | |
| dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/cl/ | |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Chile | |
| dc.subject | De Bruijn sequences | |
| dc.title | De Bruijn sequences and De Bruijn graphs for a general language | |
| dc.type | Artículo de revista | |
