Tools

DFA Minimization and Equivalence

  1. Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2006). Introduction to Automata Theory, Languages, and Computation (3rd ed.). Pearson Education.

    • Comprehensive coverage of DFA minimization algorithms and equivalence testing
    • Chapter 4: Properties of Regular Languages - detailed minimization procedures

  2. Sipser, M. (2012). Introduction to the Theory of Computation (3rd ed.). Course Technology.

    • Clear explanations of finite automata minimization techniques
    • Chapter 1: Regular Languages - fundamental concepts and algorithms

  3. Lewis, H. R., & Papadimitriou, C. H. (1997). Elements of the Theory of Computation (2nd ed.). Prentice Hall.

    • Mathematical foundations of automata minimization
    • Chapter 2: Finite Automata - rigorous treatment of equivalence and minimization