We show by an injective proof that a word w of length k >= 2 occurs as a factor in a minimum number of words of length n (n > k) if and only if all letters of w are equal. (c) 2006 Elsevier B.V. All rights reserved.
机构:
Univ Turku, Dept Math, Turku 20014, Finland
Univ Turku, Turku Ctr Comp Sci, Turku 20014, FinlandUniv Turku, Dept Math, Turku 20014, Finland
Halava, Vesa
论文数: 引用数:
h-index:
机构:
Harju, Tero
Karki, Tomi
论文数: 0引用数: 0
h-index: 0
机构:
Univ Turku, Dept Math, Turku 20014, Finland
Univ Turku, Turku Ctr Comp Sci, Turku 20014, Finland
Univ Liege, Inst Math, B-4000 Liege, BelgiumUniv Turku, Dept Math, Turku 20014, Finland
机构:
Univ Cyprus, POB 20537, CY-1678 Nicosia, CyprusUniv Cyprus, POB 20537, CY-1678 Nicosia, Cyprus
Christodoulakis, Manolis
Christou, Michalis
论文数: 0引用数: 0
h-index: 0
机构:
Kings Coll London, London WC2R 2LS, EnglandUniv Cyprus, POB 20537, CY-1678 Nicosia, Cyprus
Christou, Michalis
Crochemore, Maxime
论文数: 0引用数: 0
h-index: 0
机构:
Kings Coll London, London WC2R 2LS, England
Univ Paris Est, Champs Sur Marne, FranceUniv Cyprus, POB 20537, CY-1678 Nicosia, Cyprus
Crochemore, Maxime
Iliopoulos, Costas S.
论文数: 0引用数: 0
h-index: 0
机构:
Kings Coll London, London WC2R 2LS, England
Curtin Univ, Digital Ecosyst & Business Intelligence Inst, Perth, WA 6845, AustraliaUniv Cyprus, POB 20537, CY-1678 Nicosia, Cyprus
Iliopoulos, Costas S.
AUSTRALASIAN JOURNAL OF COMBINATORICS,
2013,
57
: 49
-
64