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