0 оценок0% нашли этот документ полезным (0 голосов)
30 просмотров34 страницы
Algorithm minimizes the number of states of any DFA y combines states having the same future behavior O(n log(n)) third algorithm produces more compact representations of transitions tables then the standard two dimensional important states of an NFA it has non-e out transitions used when computing e-closure(move(s,a))
Algorithm minimizes the number of states of any DFA y combines states having the same future behavior O(n log(n)) third algorithm produces more compact representations of transitions tables …