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