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

Stefano Varricchio

Published in: STACS (1993)

Keyphrases

learning algorithm
worst case
computational complexity
np hard
dynamic programming
matching algorithm
special case
theoretical analysis