Automata, Computability and Complexity: Theory & Applications

Determining the equivalence of two deterministic context-free grammars