Choosing appropriate data structures, the emptiness of shared forests can be decided in linear time and space with respect to the size of the forest.
the computational complexity of universal recognition is upper-bounded by the complexity of constructing the shared forest.