Hopcroft's algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]
English Wikipedia has an article on:
Wikipedia

Etymology

[edit]

Introduced by Hopcroft in 1971.

Proper noun

[edit]

Hopcroft's algorithm

  1. (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.