Automata, Computability, and Complexity: Theory and Applications by Elaine Rich

Determining the equivalence of two deterministic context-free grammars