Is there an efficient algorithm for minimizing a deterministic PDA in terms of states? Is it even computable?
I know that it is not possible to minimize a PDA in general, but my question is about deterministic PDA.
For tools like lexer generators, where occasionally a counter or a stack would be needed to lex languages with string interpolation or other constructs, the question for DPDAs would be interesting as well. The answer - and the algorithm - is well known for deterministic finite automata and to my knowledge, some lexer generator tools do utilize that.