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