Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is S2p-complete | IEEE Conference Publication | IEEE Xplore