The hardest language for grammars with context operators

Mikhail Mrykhin, Alexander Okhotin

In 1973, Greibach ("The hardest context-free language", SIAM J. Comp., 1973) constructed a context-free language $L_0$ with the property that every context-free language can be red…