finite state machine minimisation of DFA it takes normal DFA as input and gives minimised DFA which is equivalent to the previous one regular expression to NFA it takes some regular expression as input and gives the equivalent NFA