Geodesic
Classifying rotationally-closed languages having greedy universal cycles
Joseph DiMuro1
1Biola University
The electronic journal of combinatorics, Tome 26 (2019) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $\textbf{T}(n,k)$ be the set of strings of length $n$ over the alphabet $\Sigma=\{1,2,\ldots,k\}$. A universal cycle for $\textbf{T}(n,k)$ can be constructed using a greedy algorithm: start with the string $k^n$, and continually append the least symbol possible without repeating a substring of length $n$. This construction also creates universal cycles for some subsets $\textbf{S}\subseteq\textbf{T}(n,k)$; we will classify all such subsets that are closed under rotations.
DOI : 10.37236/7932
Classification : 68W32, 68Q45, 68R15

Joseph DiMuro  1

1 Biola University 
@article{10_37236_7932,
     author = {Joseph DiMuro},
     title = {Classifying rotationally-closed languages having greedy universal cycles},
     journal = {The electronic journal of combinatorics},
     year = {2019},
     volume = {26},
     number = {1},
     doi = {10.37236/7932},
     zbl = {1409.68352},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/7932/}
}
TY  - JOUR
AU  - Joseph DiMuro
TI  - Classifying rotationally-closed languages having greedy universal cycles
JO  - The electronic journal of combinatorics
PY  - 2019
VL  - 26
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7932/
DO  - 10.37236/7932
ID  - 10_37236_7932
ER  - 
%0 Journal Article
%A Joseph DiMuro
%T Classifying rotationally-closed languages having greedy universal cycles
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/7932/
%R 10.37236/7932
%F 10_37236_7932
Joseph DiMuro. Classifying rotationally-closed languages having greedy universal cycles. The electronic journal of combinatorics, Tome 26 (2019) no. 1. doi: 10.37236/7932

Cité par Sources :