5 citations · 5 across the 1 of their papers we have counts for
1 paper
Markus Lohrey, Christian Mathissen
The computational complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix…