|
|||||||||||||||
DOI: 10.1051/ita:2001104
Theoret. Informatics Appl. 35, 437-452 (2001)
A test-set for k-power-free binary morphisms
F. WlazinskiLaRIA, Université de Picardie Jules Verne, 5 rue du Moulin Neuf, 80000 Amiens, France; wlazinsk@laria.u-picardie.fr.
(Received May, 2001. Accepted November, 2001.)
Abstract
A morphism
f is
k-power-free if and only if
f(w) is
k-power-free whenever
w is a
k-power-free word.
A morphism
f is
k-power-free up to
m if and only
if
f(w) is
k-power-free whenever
w is a
k-power-free word of
length at most
m.
Given an integer
,
we prove that a binary morphism
is
k-power-free
if and only if it is
k-power-free up to
k2.
This bound becomes linear for primitive morphisms:
a binary primitive morphism is
k-power-free
if and only if it is
k-power-free up to
2k+1
Mathematics Subject Classification. 68R15.
Key words: Combinatorics on words -- k-power-free words -- morphisms -- test-sets
© EDP Sciences 2001
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook