id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ap-1827	Holub, Štepán	On an Algorithm for Multiperiodic Words	2013	3	.pdf	application/pdf	2105	147	79	This can be succinctly stated as: FW(P, k)[i] =  FW(Q, k −m)[i mod m] if (i mod m) < k −m; If k ≤ m, then Lemma 2 gives FW(P, k) = 0 · 1 · · · (k− 1).	cache/ap-1827.pdf	txt/ap-1827.txt