CS402-Midterm
1 / 50
Languages generated by kleene star are always ______________.
2 / 50
GTG can have _______________ final state.
3 / 50
“One language can be expressed by more than one NFA”. This statement is ______________.
4 / 50
In FA final state represent by _________sign
5 / 50
In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called
6 / 50
If a language can be expressed through FA, then it can also be expressed through TG.
7 / 50
In TG there may exist no paths for certain string.
8 / 50
The _______ machine helps in building a machine that can perform the addition of binary numbers.
9 / 50
Alphabet S = {a,bc,cc} has _______ number of letters.
10 / 50
If L1 and L2 are expressed by regular expressions r1 and r2, respectively then the language expressed by r1 + r2 will be _________
11 / 50
In GTG, if a state has more than one incoming transitions from a state. Then all those incoming transitions can be reduced to one transition using _____________ sign
12 / 50
One FA has n states and m letters in the alphabet. Then FA will have _____ number of transitions in the diagram.
13 / 50
“Every finite language can be expressed by FA”. This statement is __________.
14 / 50
15 / 50
(a+b)*a(a+b)*b(a+b)* is the RE of language defined over S={a,b} having at least one a and one b
16 / 50
a*b* = (ab)* this expression is __________
17 / 50
S={a,bb,bab,baabb} set of strings then S* will not have
18 / 50
19 / 50
S= {a,bc,cc} has the latters
20 / 50
In which of the following language Rev(s)=s
21 / 50
22 / 50
RE for the language defined over Σ={a,b} having words starting with a is____
23 / 50
In drawing FA3 (which is equal to FA1 + FA2), a state will be declared final if
24 / 50
The clouser FA*(star on an FA ) always accept ______string
25 / 50
In TG there may exist more than one path for certain string.
26 / 50
FA1 and FA2 are two FA’s representing two languages. Then FA3, which is sum of FA1 and FA2, will accept the strings which are
27 / 50
28 / 50
29 / 50
a(a+b)*a+b(a+b)*b is RE for the language defined over S={a,b} having words beginning and ending with same letters
30 / 50
Which of the following is not a word of language EQUAL?
31 / 50
a (a + b)* is the RE of language defined over S = {a, b} having at least one a
32 / 50
If a language has RE, then that language can be expressed through TG.
33 / 50
TG can more then one initial state
34 / 50
35 / 50
The length of output string in case of _________ is one more than the length of corresponding input string.
36 / 50
Let S = {aa, bb} be a set of strings then s* will have
37 / 50
38 / 50
One language can represents more than one RE.
39 / 50
Then initial state of FA3 will consist of
40 / 50
One FA has 3 states and 2 letters in the alphabet. Then FA will have ___________ number of transitions in the diagram
41 / 50
One language can be represented by more than one RE” this statement is____
42 / 50
In TG, there may be a transition for null string.
43 / 50
If S = {ab, bb}, then S* will not contain
44 / 50
45 / 50
If FA1 accepts no string and FA2 accepts many strings, then FA1 + FA2 will be equal to
46 / 50
If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be generated by
47 / 50
TG is always deterministic.
48 / 50
In GTG’s there may exist no path for a certain string.
49 / 50
S = {baa, ab}, then S* will not contain
50 / 50
Your score is
The average score is 54%
Restart quiz
