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