Perfect necklaces

We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular word, or necklace, is the equivalence class of a word under rotations. For positive integers k and n, we call a necklace...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Alvarez, N., Becher, V., Ferrari, P.A., Yuhjtman, S.A.
Formato: JOUR
Materias:
Combinatorics on words
de Bruijn words
Necklaces
Statistical tests of finite size
Statistical tests
De Bruijn
Finite alphabet
Finite size
Infinite periodic sequence
Lexicographic order
Positive integers
Equivalence classes
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_01968858_v80_n_p48_Alvarez
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares