Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages.

Stefano Varricchio

Browse the full STACS paper archive.