Given the language L = {ε}, is L empty?

none of the given choices
Definitely, because ε is an empty symbol
No, because the language has an empty symbol Correct
You can't say

Similar CS-6205 questions

Having the initial state as a final state, give the deterministic finite state automaton that accept...
Which among the following is the correct option for the given grammar? G->X111|G1,X->X0|00.
It is a unary operator on a set of symbols or strings, that gives the infinite set of all possible s...
For the given Regular expression, the minimum number of terminals required to derive its grammar (01...
A Finite Automaton with null moves (FA-ε) does transit not only after giving input from the alphabet...
Given that the language L = {ε}, is L empty?