最終更新日:2022/12/07
正解を見る
(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.
編集履歴(0)
元となった辞書の項目
Hopcroft's algorithm
name