20.1 Universality of letter-bounded CFLs

• 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?