Word.ws English Dictionary

Hopcroft's algorithm

Hopcroft's algorithm proper noun: an algorithm for merging the non-distinguishable states of a deterministic finite-state automaton, based on partitioning the states into groups by their behaviour.

Proper noun

Hopcroft's algorithm

  1. An algorithm for merging the non-distinguishable states of a deterministic finite-state automaton, based on partitioning the states into groups by their behaviour.

Origin of Hopcroft's algorithm

Introduced by Hopcroft in 1971.

Questions about Hopcroft's algorithm

What does Hopcroft's algorithm mean?
Hopcroft's algorithm means an algorithm for merging the non-distinguishable states of a deterministic finite-state automaton, based on partitioning the states into groups by their behaviour.
What part of speech is Hopcroft's algorithm?
Hopcroft's algorithm is a proper noun.

Words near Hopcroft's algorithm in the dictionary

  1. hopbush
  2. hopbushes
  3. Hopcalite
  4. Hopcalites
  5. Hopcroft
  6. Hopcroft's algorithm
  7. hope
  8. hope against hope
  9. Hope Cay
  10. hope chess
  11. hope chest

Source and license

Adapted from Wiktionary: Hopcroft's algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Hopcroft's algorithm.” Word.ws, https://word.ws/hopcroft%27s_algorithm. Based on Wiktionary, CC BY-SA 4.0.