Maze Reduction: Difference between revisions
Jump to navigation
Jump to search
imported>Kmk21 Created page with "Category:ICPC Problems Category:Finals2014" |
imported>Kmk21 No edit summary |
||
| Line 1: | Line 1: | ||
This is a rather straightforward DFA Minimization problem: | |||
https://en.wikipedia.org/wiki/DFA_minimization#Hopcroft.27s_algorithm | |||
Moore's may work, but to be fast enough, should probably use hopcroft | |||
[[Category:ICPC Problems]] | [[Category:ICPC Problems]] | ||
[[Category:Finals2014]] | [[Category:Finals2014]] | ||
[[Category:DFA Minimization]] | |||
Revision as of 18:23, 25 August 2016
This is a rather straightforward DFA Minimization problem: https://en.wikipedia.org/wiki/DFA_minimization#Hopcroft.27s_algorithm
Moore's may work, but to be fast enough, should probably use hopcroft