Which of the following is false?
For every NFA there exist an equivalent DFA and viceversa. Power of both NFA and DFA for recognization of language is same.
Let r_{1 }= ab*c*and r_{2 }= (a*b+c)*and r_{3 }= (a+b+c)*. Then which of the following is true
ac ∈ L(r_{1}), since we can take b* as ∈ and c* as c. ac ∈ L (r_{3}), since (a + b + c ) * includes all combinations of a, b and c.
ac ∉ L(r_{2}) since whenever (a * b + c)* is taken to include a, “a is always followed by b".
a*b = b, ab, aab, .... & so on.
Let ∑ = {a, b}, r_{1} = a(a + b)* and r_{2} = b(a + b)*. Which of the following is true?
L(r_{1}) is the set of all string starting with ‘a’.
L(r_{2}) is the set of all starting with ‘b’.
Since any word belonging to ∑* either starts with “ a ” or starts with " b ” or is “∈ ” , therefore
Which of the following statements are true?
(i) abcd ∈ L((b*a*)* (d*c*)*)
(ii) abcd ∈ L((d*c*b*a*)*)
(iii) abcd ∈ L((a*b*a*c*d*)*)
Note that
gives all the combinations of a and b followed by all the combinations of c and d, for
will generate all strings with combination of a, b, c, b and d.
Which of the following are regular languages?
(i) The language w has an odd number of b’s}.
(ii) The language w has an even number of b’s).
(iii) The language has an even number of b’s and odd number of a’s).
As we can construct the DFA for the given languages, hence all of the given languages are regular.
Which of the following regular expression corresponds to the language of all strings over the alphabet {a, b) that contains exactly two a’s
(i) aa
(ii) ab*a
(iii) b* ab*a
All languages are accepting strings over the alphabet {a, b} that contains exactly two a’s but they are not accepting all strings like the first choice just accepts ‘aa’. The second choice can’t accept ‘baa’. The third choice can’t accept ’baab’. The correct regular expression is b* a b* a b*.
Which of the following regular expression corresponds to the language of all strings over the alphabet {a, b} that do not end with ab?
Choice ‘a’ is incorrect since it does not include the string “a”, “b” and "∈” (all of which do not end with ab).
None of choices 'c' or ‘d ’ accept the string ‘a ’, So they can’t represent specified language.
What is regular expression corresponding to the language of strings of even lengths over the alphabet of {a, b}?
The regular expression corresponding to the language of strings of even lengths over the alphabet of {a, b} is ((a + b)^{2})* which is equivalent to (aa + bb + ba + ab)*. In choice (b) the string ‘ab’ is not present. In choice (c) the string ‘aa’ is not present. In choice (d) odd length strings are also acceptable.
How many minimum number of states are required in the DFA (over the alphabet {a, b}) accepting all the strings with the number of a’s divisible by 4 and number of b’s divisible by 5?
For DFA accepting all the strings with number of a’s divisible by 4; four states are required similarly for DFA accepting all the strings with number of b’s divisible by 5, five states are required and for their combination, states will be multiplied. So 5 x 4 = 20 states will be required.
Use Code STAYHOME200 and get INR 200 additional OFF

Use Coupon Code 








