Minimization of DFA

References (IEEE style):

• [1] J. Martens and A. Wijs, “An Evaluation of Massively Parallel Algorithms for DFA Minimization,” arXiv preprint arXiv:2410.22764, Oct. 2024. Available: https://arxiv.org/abs/2410.22764
• [2] A. Badr, V. Geffert, and I. Shipman, “Hyper-minimizing minimized deterministic finite state automata,” RAIRO Theoretical Informatics and Applications, vol. 43, no. 1, pp. 69–94, 2009. Available: http://eudml.org/doc/245126
• [3] B. W. Watson, “An efficient incremental DFA minimization algorithm,” Journal of Automata, Languages and Combinatorics, vol. 8, no. 1, pp. 35–57, 2003. Available: https://dl.acm.org/doi/abs/10.1017/S1351324903003127
• [4] A. Valmari and P. Lehtinen, “Efficient Minimization of DFAs with Partial Transition Functions,” arXiv preprint arXiv:0802.2826, Feb. 2008. Available: https://arxiv.org/abs/0802.2826