×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
W is any string whose length is n in {0, 1}* and L is the set of all sub-strings of W. The minimum number of states in a non-deterministic finite automaton that accepts L is
2.
Consider a string s over (0+1)*. The number of 0’s in s is denoted by no(s) and the number of 1’s in s is denoted by n1(s). The language that is not regular is
3.
Which one of the following statement is false?
4.
For the above FSA the equivalent minimum state automaton has the following number of states
5.
Out of the three decision problems P1, P2 and P3, P1 is decidable and P2 is undecidable. The statement that holds true is
6.
G = {S->SS, S->ab, S->ba, S->?} is the context free grammar whose statements are given below:
a. G is ambiguous
b. G produces all strings with equal number of a's and b's.
c. Deterministic PDA accepts G
Which of the following statement is true about G?
a. G is ambiguous
b. G produces all strings with equal number of a's and b's.
c. Deterministic PDA accepts G
Which of the following statement is true about G?
7.
The minimum number of states in any DFA accepting the regular language L = (111+11111)* is
8.
Consider a graph G = (V, E) where I V I is divisible by 3. The problem of finding a Hamiltonian cycle in a graph is denoted by SHAM3 and the problem of determining if a Hamiltonian cycle exits in such graph is denoted by DHAM3. The option, which holds true, is
9.
We have decision problems P1 and P2 as described below:
P1: Does a given finite state machine accept a given string?
P2: Does a given context-free grammar generate an infinite number of strings?
The statement that holds true for P1 and P2 is
P1: Does a given finite state machine accept a given string?
P2: Does a given context-free grammar generate an infinite number of strings?
The statement that holds true for P1 and P2 is
10.
Which one of the following statement is true for the C language?