CycleWalkingFPE(x) { if P(x) is an element of M return P(x) else return CycleWalkingFPE(P(x)) } The recursion is guaranteed to terminate.
CycleWalkingFPE(x) { if ''P''(x) is an element of ''M'' return ''P''(x) else return CycleWalkingFPE(''P''(x)) } Цикл обязательно завершится.