How Many Steps Are Necessary to Separate a Bigraph?

Abstract

There exist bigraphs that are deterministically separable, but in no less than n steps, for any n∈$\text{N}$. Further there exist bigraphs that are non-deterministically separable, but in no less than 3 steps.