Hopcroft's algorithm
Jump to navigation
Jump to search
English
[edit]Etymology
[edit]Introduced by Hopcroft in 1971.
Proper noun
[edit]- (computing theory) An algorithm for merging the non-distinguishable states of a deterministic finite-state automaton, based on partitioning the states into groups by their behaviour.