Is it possible to reduce aLR parser's states by using DFA minification algorithm?

Well, when I learnt Regular Grammar and Regular Expression, the last step of constructing a DFA is to minimize the states by applying the Hapcroft Algorithm. Now I am reading the purple dragon book about the LR parsing. Oddly it didn't mention the LR(0) automata, which is a DFA, can be further optimized with the minification algorithm. It is just not neccessary (like the final DFA is promised to be a minimized DFA), or it is impossible to do it?