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