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