Key points are not available for this paper at this time.
We sketch a tentative proof of P-completeness for the -convertibility problem on untyped planar (a. k. a. ordered or non-commutative) -terms.
Das et al. (Mon,) studied this question.