CS402-Midterm
1 / 50
In TG there may exist no paths for certain string.
2 / 50
a (a + b)* is the RE of language defined over S = {a, b} having at least one a
3 / 50
Then initial state of FA3 will consist of
4 / 50
RE for the language defined over Σ={a,b} having words starting with a is____
5 / 50
GTG can have _______________ final state.
6 / 50
If an alphabet has n number of letter, then number of strings of length m will be
7 / 50
S={a,bb,bab,baabb} set of strings then S* will not have
8 / 50
S= {a,bc,cc} has the latters
9 / 50
Languages generated by kleene star are always ______________.
10 / 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
11 / 50
In FA final state represent by _________sign
12 / 50
“Every finite language can be expressed by FA”. This statement is __________.
13 / 50
One language can be represented by more than one RE” this statement is____
14 / 50
In GTG’s there may exist no path for a certain string.
15 / 50
Σ={a,Aa,Abb}, then string aAaAbbAa has ________ length.
16 / 50
17 / 50
One FA has n states and m letters in the alphabet. Then FA will have _____ number of transitions in the diagram.
18 / 50
In drawing FA3 (which is equal to FA1 + FA2), a state will be declared final if
19 / 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
20 / 50
In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called
21 / 50
One language can represents more than one RE.
22 / 50
23 / 50
Every FA should be __________
24 / 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
25 / 50
Two machines are said to be equivalent if they print the same output string when the different input string is run on them
26 / 50
TG can more then one initial state
27 / 50
28 / 50
TG is always deterministic.
29 / 50
If a language is expressed through TG, then that language will have its RE.
30 / 50
The length of output string in case of _________ is one more than the length of corresponding input string.
31 / 50
In which of the following language Rev(s)=s
32 / 50
33 / 50
Which statement is true?
34 / 50
35 / 50
If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be generated by
36 / 50
If FA1 accepts no string and FA2 accepts many strings, then FA1 + FA2 will be equal to
37 / 50
38 / 50
39 / 50
The clouser FA*(star on an FA ) always accept ______string
40 / 50
In NFA, there may be more than one transition for certain letters and there may not be any transition for certain letters. This statement is ______________.
41 / 50
Alphabet S = {a,bc,cc} has _______ number of letters.
42 / 50
Length of strings, generated by infinite language is_______
43 / 50
One FA has 3 states and 2 letters in the alphabet. Then FA will have ___________ number of transitions in the diagram
44 / 50
(a + b)* a is RE for the language defined over S={a,b} having words not ending in b
45 / 50
If a language has RE, then that language can be expressed through TG.
46 / 50
“One language can be expressed by more than one NFA”. This statement is ______________.
47 / 50
48 / 50
According to 3rd part of the Kleene’s theorem, If a language can be accepted by an RE then it can be accepted by a _________ as well
49 / 50
FA1 corresponds to r*, then FA1 must accept _______________ string.
50 / 50
If a language can be expressed through FA, then it can also be expressed through TG.
Your score is
The average score is 54%
Restart quiz
