20.1 Universality of letter-bounded CFLs By Moses Ganardi July 21, 2020 Input: a context-free grammar for a language $L \subseteq a_1^* \dots a_n^*$ ($n$ is part of the input) Question: Is $L = a_1^* \dots a_n^*$? What is the complexity of the problem? Newer 20.8 Good games for good-for-games automata Older 20.2 Deterministic separability of nondeterministic timed languages