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