There exist binary circular power free words of every length.
Aberkane, Ali; Currie, James D.
The Electronic Journal of Combinatorics [electronic only] (2004)
- Volume: 11, Issue: 1, page Research paper R10, 10 p.-Research paper R10, 10 p.
- ISSN: 1077-8926
Access Full Article
topHow to cite
topAberkane, Ali, and Currie, James D.. "There exist binary circular power free words of every length.." The Electronic Journal of Combinatorics [electronic only] 11.1 (2004): Research paper R10, 10 p.-Research paper R10, 10 p.. <http://eudml.org/doc/124351>.
@article{Aberkane2004,
author = {Aberkane, Ali, Currie, James D.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper R10, 10 p.-Research paper R10, 10 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {There exist binary circular power free words of every length.},
url = {http://eudml.org/doc/124351},
volume = {11},
year = {2004},
}
TY - JOUR
AU - Aberkane, Ali
AU - Currie, James D.
TI - There exist binary circular power free words of every length.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2004
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 11
IS - 1
SP - Research paper R10, 10 p.
EP - Research paper R10, 10 p.
LA - eng
UR - http://eudml.org/doc/124351
ER -
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.