Hopcroft's algorithm
English
Etymology
Introduced by Hopcroft in 1971.
Proper noun
- (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.
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.