'规范化'函数(来自Ukkonen的论文,如下所示)是如何工作的?特别是,while循环何时结束?我认为p'-k'的值将始终小于p-k的值。我的理解对吗?
procedure canonize(s, (k, p)):
1. if p < k then return (s, k)
2. else
3. find the tk–transition g'(s, (k', p')) = s' from s;
4. while p' − k' <= p − k do
5. k = k + p' − k' + 1;
6. s = s';
7. if k <= p then find the tk–transition g'(s, (k', p')) = s' from s;
8. return (s, k).