GROWTH DEVELOPMENT CHILD
CHOMSKY LANGUAGE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
does not exist.
|
|
|
has no accepting state.
|
|
|
is non-deterministic.
|
|
|
None of the above
|
Detailed explanation-1: -Yes. This is immediate from the definitions. A DFA accepts if it’s in an accepting state after it’s read its input. If the input is the empty string, the DFA makes no transitions so, after reading it’s input, it’s still in its initial state, q0.
Detailed explanation-2: -Yes Possible. If an automata is not acceptor but transducer then final state is not needed. Any class of an automata can be without a final state!
Detailed explanation-3: -The language of a DFA is empty iff there are no final states that are reachable from the start state. You can tell by doing a depth-first traversal from the start state and keeping track of any final states you encounter. Incidentally, while you’re doing that you can also check for cycles at the same time.
Detailed explanation-4: -Hence, 4 states will be required.