This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
$\{g\in\mathtt{CFG}(\{a,b\})\mid\mathcal{L}(g)=\{a,b\}^*\}\quad\leq\quad\{\langle G_1,G_2\rangle\mid\mathcal{L}(G_1)=\mathcal{L}(G_2)\}$
Reduce the universality problem on CFGs over $\{a,b\}$ to the equivalence
problem between two CFGs, in order to prove that such problem is not
semi-decidable (not recursively enumerable).
Authors: Guillem Godoy
/
Documentation: