### Menu Navigation • Cell: +92(308)611-2254

# Study Mid Term Quiz-1 CS402 Theory Of Automata Online

(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
TRUE
FALSE
such a language does not exist
none of given
One FA has n states and m letters in the alphabet. then FA will have _______________ number of transitiona in the diagram.
(n)+(m)
(m)(n)OR(n)(m)
none of the given

(m)-(n)

If in an NFA, ^ is allowed to be a label of  an edge then that NFA is called _______________
will not remain NFA
NFA with
NFA with null string
either "NFA with null string " OR "NFA with" above given FA accepts null string.

TRUE
FALSE
FA is not valid
none of these
TG can have more than one initial state
TRUE
FALSE
depends on alphabets
none of these above given TG's are _______________

none of these
equivalent
non-equivalent
TG's are not valid 101111010
101111010
1111010
1010101
Two machines are said to be equivalent if they print the same output string when the different input string is run on them
TRUE
FALSE
depends on language
may be or may not be
FA3 expresses r1r2. then there will be at least one final state of FA3 that consist of final state of FA1 and initial state of FA2.
TRUE
FALSE
depends on language
none of these
FA3 expresses r1r2. then initial state of FA3 will consist of
initial state of FA2
initial state of FA1
initial states of both FA1 & FA2
depends on FA's then what will be written in place of X

(ab+ba)(aa+bb)(ba+ab)

(ab+ba)(aa+bb)(ab+ba)
(ab+ba)(aa+bb)*(ab+ba)
(ab+ba)(aa+bb)*(ab+ba)* above given GTG accepts the language in which strings

contain double a or double b
contains both a and b
depends on the alphabet
none of these above given FA generstes the languges having strings of _______________

ODD length
EVEN LENGTH
equal number of a's and b's
none of these
If S={ab,bb}, then S*will not contain
abbbab
bbba
bbbbab
ababbb
In which the following language Rev(s)=s
EQUAL
INTEGER
PALINDROME
Alphabet S={a,bc,cc} has _______________ number of letter.
one
two
three
four
(a+b)*a is RE for the language defined as over S= {a,b} having words not ending in b
TRUE
FALSE
a(a+b)* is the RE for the language defined over S={a,b} having words not ending in b
TRUE
FALSE
such a language does not exist
none of these
FA1 and FA2 are two FA's representing two languages. then FA3 , whivh is sum of FA1 and FA2 ,will accept the strings which are
accepted by FA! and FA2
accepted by FA1 or FA2
accepted by FA1AND/ORfa2
none of the given option above given TG represents the language i.e

EVEN-EVEN
PALINDROME
FACTORIAL
none of these above given TG represents the language _______________

begins and ends with same letters
begins and ends with different letters
begind with a
none of these above given TG accepts the language in which all strings

ends in b
begins with b
ends and begins with b
none of given
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 _______________
FALSE
TRUE
depends on language
none of these
FA1 corresponding to r
*, then FA 1 must accept _______________ string
every
null
odd length
even length FA3 will express r1r2. then F3 will have _______________ number of states in its diagram.

8
7
6
5
In TG there may exist no parts for certain string
TRUE
FALSE
depends on the language
none of these above given FA can be expressed by

(a+b)*a
(a+b)*b
a(a+b)*
b(a+b)*
If a language has RE, then that language can be expressed through TG.
TRUE
FALSE
depends on language
none of these
a(a+b)*a+b(a+b)*b is RE for the language can be expressed  over S={a,b} having words beginning and ending with same latters
TRUE
FALSE
such a language is not regular
none of these
One language can represented by more than one RE this statement is _______________
FALSE
TRUE
sometimes true & sometimes false
none of these TRUE
FALSE
sometimes true "& some times false
none of these
S={baa,ab}, then S* will not contain
abbaab
abab
baabaa
abbaa (aa+bb+(ab+ba)(aa+bb)(ab+ba))*
(aa+bb+(ab+ba)(aa+bb)*(ab+ba))*
(aa+ab+(bb+ba)(ab+bb)(ab+aa))*
(ab+ba+(ab+ba)(aa+bb)(ab+ba))(* above given two TG's are _______________

equivalent
none equivalent
not valid
none of given above given TG has _______________ RE.

b(a+b)*
b*(a+b)
b*(a+b)
none of these above given TG has _______________RE.

(aa+bb+(ab+ba)(aa+ab)*(ab+ba))*
(aa+bb+(ab+ba)(aa+bb)*(ab+ba))*
(aa+bb+(ab+ba)(aa+bb)(ab+ba))*
none of these above given structure is a _______________

FA
TG
FA & TG
NFA above given NFA-^ accepts _______________

bab
a
aba
a&aba then what will be written in place of X.

(ab+ba)(aa+bb)(ba+ab)
(ab+ba)(aa+bb)(ab+ba)
(ab=ba)(aa+bb)*(ab+ba)
(ab+ba)(aa+bb)(ab+ba)* above given GTG accepts the language in which strings

contains double a or double b
cotains both a and double b
depends on the alphabet
none of these above given FA is drawn using

tree structure
it is not an FA
graph structure
none of these above given FA can be expressed as _______________

(a+b)*
a*+b*
(ab+ba)*
none of these
PALINDEROME can be defined by more than one regular language
TRUE
FALSE
by only one  RE
sometimes by only one Re and sometimes false
" Every infinite language is regular" this statement is
TRUE
FALSE
can't be supposed
none of these
one language can be repressented by more than one RE this statement is _______________
FALSE
TRUE
can't be assumed
none of these
If S={aa,bb},then S* will not contain.
aabbaa
bbaabbbb
aaabbb
aabbbb
Which of the following is not a word of language EQUAL?
aaabbb
abbabaa
abababa
bbbaaa
If r1 and r2 are regular expressions then which of the following is not regular expression.
r1=r2
r1r2
r1*
r1-r2 above given FA and NFA are equivalent. this statement is _______________
TRUE
FALSE
FA & NFA can never be equivalent
none of these above given TG accepts the _______________ stroing.

bb
baba
bbba
all of the options