16 citations · 21 across the 3 of their papers we have counts for
1 paper · 1 filter
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…