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