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