Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Mehlhorn, K. (1976). An Improved Lower Bound on the Formula Complexity of Context-Free Recognition. Elektronische Informationsverarbeitung und Kybernetik, 12, 523-524.