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