Menu

Transformation from NFA to DFA Questions

MCQ
11.
What is the complement of the language accepted by the NFA shown below? Assume ? = {a} and ? is the empty string.

forum Discussion
MCQ
12.
Given the language L = {ab, aa, baa}, whih of the following strings are in L*?

i) abaabaaabaa
ii) aaaabaaaa
iii) baaaaabaaaab
iv) baaaaabaa
forum Discussion
MCQ
13.
Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. Complete the partially completed DFA that accepts this language is shown below.
The missing arcs in the DFA are
forum Discussion
MCQ
14.
Which of the following problems occur?

i) Does a given program ever produce an output?
ii) If L is a CFL, then is L
forum Discussion
MCQ
15.
The definition of a language L with alphabet {a} is given as following. L = { ank | k > 0, and n is a positive integer constant} What is the minimum number of states needed in a DFA to recognize L?
forum Discussion
chevron_left BackPage 2 of 2