0
$\begingroup$

How would you write a language for a context-free grammar that generates an empty string. Is it something like E = { (G) | G is a CFG and L(G) = Ø}?

Improve this question
$\endgroup$
2
  • 1
    $\begingroup$ If $L(G) = \emptyset$ then $G$ doesn't generate the empty string, since it doesn't generate any strings. $\endgroup$
    – Yuval Filmus
    Commented Apr 2, 2020 at 14:18
  • $\begingroup$ Does it generate only the empty string or the empty string with perhaps some others? From your second sentence, it appears the former. $\endgroup$
    – Rick Decker
    Commented Apr 2, 2020 at 17:20

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.