| dc.creator | Becher, Veronica Andrea | |
| dc.creator | Heiber, Pablo Ariel | |
| dc.date.accessioned | 2019-02-07T17:42:52Z | |
| dc.date.accessioned | 2022-10-15T16:55:57Z | |
| dc.date.available | 2019-02-07T17:42:52Z | |
| dc.date.available | 2022-10-15T16:55:57Z | |
| dc.date.created | 2019-02-07T17:42:52Z | |
| dc.date.issued | 2011-09 | |
| dc.identifier | Becher, Veronica Andrea; Heiber, Pablo Ariel; On extending de Bruijn sequences; Elsevier Science; Information Processing Letters; 111; 18; 9-2011; 930-932 | |
| dc.identifier | 0020-0190 | |
| dc.identifier | http://hdl.handle.net/11336/69649 | |
| dc.identifier | CONICET Digital | |
| dc.identifier | CONICET | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/4412049 | |
| dc.description.abstract | We give a complete proof of the following theorem: Every de Bruijn sequence of order n in at least three symbols can be extended to a de Bruijn sequence of order n+1. Every de Bruijn sequence of order n in two symbols can not be extended to order n+1, but it can be extended to order n+2. © 2011 Elsevier B.V. | |
| dc.language | eng | |
| dc.publisher | Elsevier Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/https://dx.doi.org/10.1016/j.ipl.2011.06.013 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0020019011001840 | |
| dc.rights | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
| dc.rights | info:eu-repo/semantics/restrictedAccess | |
| dc.subject | COMBINATORIAL PROBLEMS | |
| dc.subject | DE BRUIJN SEQUENCES | |
| dc.subject | GRAPH ALGORITHMS | |
| dc.subject | WORD PROBLEMS | |
| dc.title | On extending de Bruijn sequences | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
