Simple Bisimilarity Minimization in O(m log n) Time
Antti Valmari · Fundamenta Informaticae · 2010
A new algorithm for bisimilarity minimization of labelled directed graphs is presented. Its time consumption is O(m log n), where n is the number of states and m is the number of transitions. Unlike earlier algorithms, it meets this bound even if the