In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation problem is complete for logarithmic space or NC$^1$, respectively. This solves an open problem from Balc\'azar, Gabarr\'o, and S\'antha. Furthermore, if only one of the input graphs is required to be a tree, the bisimulation (simulation) problem is contained in AC$^1$ (LogCFL). In contrast, it is also shown that the simulation problem is P-complete already for graphs of bounded path-width.

@article{paperbot366,
  title = {The Complexity of Bisimulation and Simulation on Finite Systems},
  author = {Moses Ganardi and Stefan Göller and Markus Lohrey},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 14, Issue 4},
  year = {2018},
  doi = {10.23638/lmcs-14(4:5)2018}
}