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