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