Classes of X-functors Reducing Pattern Matching on Nets to Pattern Matching on Forests of Binary Trees

Abstract.  Classes of X-functors are presented which reduce pattern matching problems for nets to pattern matching problems for forests of binary trees. In this way lower bounds for pattern matching on nets can be transformed into the tree case, and also upper bounds for pattern matching on forests of binary trees can be transformed into the net case.