设∑＝{α1, α2…… αn }是n个互不相同的符号组成的符号集。

Lk＝{β1β2…βk | βiЄ ∑,1≤i≤k}是∑中字符组成的长度为k 的全体字符串。

S是Lk的子集，S是Lk的无分隔符字典是指对任意的S中元素a1a2…ak， b1b2…bk.

{a2a3…akb1, a3a4…akb1b2, ……, akb1b2… bk-1 }∩S=Φ。该算法算法，对于给定的正整数n 和k，计算 Lk的最大无分隔符字典。

-Set Σ = [α1, α2 ... ... αn] are n个separate symbols symbol set. Lk = [β1β2 ... βk | βiЄ　Σ, 1 ≤ i ≤ k] Σ Medium characters are composed of all k length strings. S a subset of Lk are, S are non-Lk separator dictionary refers to the arbitrary element S Medium a1a2 ... ak, b1b2 ... bk. [A2a3 ... akb1, a3a4 ... akb1b2, ... ..., akb1b2 ... bk-1] ∩ S = Φ. The algorithm algorithm, for a given positive integer n and k, calculated Lk largest free dictionary separator.