\] that the number of [elementary operation]{}s needed for this algorithm to accept is at most $0|W|$. Hence, it follows from the definition of [elementary operation]{}s over [pseudobracket system]{}s for $W$ that the time needed to run this nondeterministic algorithm is 