CS402-Mid Term Solved MCQs With References by Moaaz

CS402- Theory of Automata genrica
Solved MCQS
From Midterm Papers
https://genrica.com Virtual University
MIDTERM EXAMINATION
CS402- Theory of Automata
Question No: 1 ( Marks: 1 ) - Please choose one

Σ={a,Aa,Abb}, then string aAaAbbAa has ________ length.
► One
► Two
► Three
► Four (Page 4)

Languages generated by kleene star are always ______________.
► Finite
► Infinite (Page 7)
► Sometimes finite & sometimes infinite
► None of the these

Let S = {aa, bb} be a set of strings then s* will have
►Λ (Page 7)
► abba
► aabbbaa
► bbaab

If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be generated by
► (r1)(r2)
► (r1 + r2)
► (r2)*
► (r1)* (Page 10)
genrica.com Virtual University

a, b
x y
a, b
Above given FA can be represented by

► ((a+ b) (a + b))* (Page 13)
► (a + b)(a + b)*
► (a + b)(a + b)
► (a + b)*(a + b)*

a,b
a,b
1 2+
Above given FA accepts ___________ strings defined over Σ={a , b}

► All (Page 15)
► Some
► All but not null
► None of these

If a language can be expressed through FA, then it can also be expressed through TG.
► True (Page 25)
► False
► Depends on language
► None of the above

.b a a
b
b a
2- 4+ 1- 3+
b a
a b
5 a 6 b
Above given TG has ____________________ RE.

► a+b+a(a + b)*a + b(a + b)*b
► a(a + b)*a + b(a + b)*b
► both are given
► none of the given

.b a a
b
b a
2- 4+ 1- 3+
b a
a b
5 a 6 b
Above given FA accepts the language in which strings

► Begins with and ends in same letter
► Begins with and ends in different letter
► Has length more than 2
► None of the given

GTG can have _______________ final state.
►0
►1
► More than 1
► All of the given Click here for detail

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
►-
►+ (Page 27)
►*

“One language can be expressed by more than one NFA”. This statement is ______________.
► False
► True (Page 41)
► Depends on NFA

aa+bb aa+bb
ab+ba
3- Λ 1 2
ab+ba
Λ
4+
If above given TG is drawn like
aa+bb
3 Λ 1 X
-
Λ
4
+ written in place of X.
Then what will be
► (ab+ba)(aa+bb)(ba+ab)
► (ab+ba)(aa+bb)(ab+ba)
► (ab+ba)(aa+bb)*(ab+ba) (Page 31)
► (ab+ba)(aa+bb)(ab+ba)*

2 ^
4+
a
a
1- a a
^, b
3 b a
5
Above given structure is an ________.

► FA
► NFA
► NFA -^ (Page 42)
► TG

One FA has 3 states and 2 letters in the alphabet. Then FA will have ___________ number of transitions in the
diagram
►4
►5
►7
► 6 (Page 14)

b
b
1- 3+
aa
a
a
2- 4+
bb
Above given two TG’s are _______________.
► Equivalent (Page 26 - 27)
► None-equivalent
► Not valid
MIDTERM EXAMINATION

If an alphabet has n number of letter, then number of strings of length m will be
►n+m
► (n)(m)
►m^n
►n^m (Page 6)

►Finite
►Infinite (Page 7) rep
►Sometimes finite & sometimes infinite
►None of the these
►True
►False
►Sometimes true & sometimes false
►None of these

a*b* = (ab)* this expression is __________
►True
►False
►Can’t be assumed
►None of these
Above given FA can be expressed as ________

► (a + b)* (Page 19)
►a* + b*
► (ab + ba)*
►None of these

If a language is expressed through TG, then that language will have its RE.
►True (Page 25)
►False
►Depends on language
►None of these

Above given FA accepts _____________ language.

►Finite (Page 17)
►Infinite
►Depends on alphabet
►None of these

In TG there may exist more than one path for certain string.
►True (Page 25)
►False
►Depends on the language
►None of these

In TG there may exist no paths for certain string.
►True (Page 25)
►False
►None of these

GTG can have _______________ final state.
►0
►1
►More than 1
►All of the given Click here for detail Rep
Above given diagram is an NFA. If we convert it into an FA using transition table, then new FA will be
consisted on ______________ number of states.
►6
►5
►4 (Page 45)
►3
Above given TG accepts the language in which all strings

►Ends in b
►Begins with b
►Ends and begins with b
►None of the given
Above given TG has _____________ RE.

►a(a + b)*b + b(a + b)*a
►b(b + a)*a + b(a + b)*a
►None of these
►a(a + b)*a + b(a + b)*b

Every FA should be __________
►Deterministic (Page 25)
►Non- Deterministic
►Deterministic & Non- Deterministic
►None of these
MIDTERM EXAMINATION
Question No: 1 (Marks: 1) - Please choose one

Auto Meta mean
► Manual work
► Automatic work (Page 3)

S= {a,bc,cc} has the latters
►1
►2
►3
►4

S={a,bb,bab,baabb} set of strings then S* will not have
► baba
► baabbab
► bbaaabb
► bbbaabaabb

One language can represents more than one RE.
► True (Page 9)
► Falss
► Can’t be assumed
► Non of given

Given GTG has RE

► (a+b)* (aa+bb)(a+b)* (Page 24)
► None of option
NFA accept ______String

►b
► babab
► baaab
► all (Page 43)
Question No:7 (Marks: 1) - Please choose one
NFA accept ______String

► bab
►a
► aba
► a & aba (Page 43)
TG has
► (a+b)*
► Λ+(a+b)*a (Page 20)
► Λ+(a+b)*a*
► None of given
10

TG can more then one initial state
► True (Page 26)
► False
► Depend on alphabets
► None of given
Question No:10 (Marks: 1) - Please choose one
RE will be
► (a+b)*
► (a+b)*(a*+b*)
► None of the given (Page 37)
Ref:- regular expression corresponding to above two FA’s can be (a+b)((a+b)(a+b))* or ((a+b)(a+b))*(a+b)

The clouser FA*(star on an FA ) always accept ______string
► Null (Page 7)
► aa
► bb
► None of given

In FA final state represent by _________sign
►+
►-
►=
►*

In FA one enter in specific stat but there is no way to leave it then state is called
► Dead States
► Waste Baskets
► Davey John Lockers
► All of above (Page 17)
11

Using tree structure final state represent by
►*
►-
► double circle (Page 13)
► None of given
► a’s occur only in even clumps and that ends in three or more b’s (Page 22)
► length larger then 2
► it does not accept any language
► none of given option
These GTG are ________

► Equal (Page 27)
► Not equal
► Not valid
► None of given
NFA to FA will_____________
► Equal (Page 43)
► Not equal
► Not valid
► None of given
12

FA having RE______
Λ + a + b + (a+b)*(ab+ba+bb) (Page 18)
a + b + (a+b)*(ab+ba+bb).
MIDTERM EXAMINATION

Length of strings, generated by infinite language is_______
►finite (Page 7)
►infinite
►none of these
Ref:- By infinite language, it is supposed that the language contains infinite many words, each of finite length

RE for the language defined over Σ={a,b} having words starting with a is____
►a(a+b)* (Page 12)
► (a+b)*a
► (a+b)*
►None of these
13

“Every Infinite language is regular” this statement is
►True (Page 11)
►False

a,b
1– 2+
a,b
Above given FA accepts the null string
►True
►False

a+b a+b
aa+bb
- +
Above given GTG accepts the language in which strings

Contains double a or double b (Page 24)
Contains both a and double b
Depends on the alphabet
None of these

2+
a
1- a
3
a
b
4 5+
Above given NFA accepts the ______ number of strings
►one
►two (Page 40)
►three
►four
14

aa+bb aa+bb
ab+ba
3- Λ 1 2
ab+ba
Λ
4+
aa+bb
3 Λ 1 X
-
Λ
4
Then what will be
► (ab+ba)(aa+bb)*(ab+ba) (Page 31) rep
2 ^
4+
a
a
1- a a
^, b
3 b a
5

► FA
► NFA
► NFA -^ (Page 42) rep
► TG
15

TG is always deterministic.
►True
►False (Page 25)

The length of output string in case of _________ is one more than the length of corresponding input string.
►Finite Automaton (Page 55)
►TG
►GTG

a,b
––
b +
Above given TG accepts the _____________ string.

►bb
►baba
►bbba
►all of the given options (Page 19)

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 (Page 42) rep
Either "NFA with null string" OR "NFA with "
Above given FA generates the strings which __________

►Starting and ending with same letters
► Starting and ending with different letters
►None of these
16

Above given FA accepts _____________ language.

►Finite (Page 17) rep
►Infinite
►None of these
MIDTERM EXAMINATION

Length of null string is
►Always not equal to 0
►Always equal to 0 click here for detail
►It has variable length
►All are true
17

If an alphabet has n number of letter, then number of strings of length m will be
►n+m
► (n)(m)
►m^n
►n^m (Page 6) rep

►Finite
►Infinite (Page 7) rep
►Sometimes finite & sometimes infinite
►None of the these

“Every finite language can be expressed by FA”. This statement is __________.
►True
►False
►None of these

In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called
►Dead States
►Waste Baskets
►Davey John Lockers
►All of these (Page 17)

►True (Page 25) rep
►False
►None of these

In GTG’s there may exist no path for a certain string.
►True (Page 25)
►False
►None of these
18

In drawing FA3 (which is equal to FA1 + FA2), a state will be declared final if
►States of both FA’s are final
►At least one state is final (Page 32)
Ref:- Let FA3 be an FA corresponding to r1r2, then the initial state of FA3 must correspond to the initial state
of FA1 and the final state of FA3 must correspond to the final state of FA2.

►FA
►NFA
►NFA -^ (Page 42) rep
►TG
►Above given TG represents the language____

►Begins and ends with same letters
►Begins and ends with different letters (Page 21)
►Begins with a
►None of these
19

In TG, there may be a transition for null string.
►True (Page 18)
►False
►Can’t show transition for string
►None of these
Ref:- Finite set of transitions that show how to go from one state to another based on reading specified
substrings of input letters, possibly even the null string (Λ).

The _______ machine helps in building a machine that can perform the addition of binary numbers.
►Incrementing (Page 60)
►Complementing
►Decrementing

►GTG can have _____________ initial state.
►Zero
►One
►More than One
►One OR more than One (Page 23)
Ref:- Finite number of states, at least one of which is start state and some (maybe none) final states.

One FA has n states and m letters in the alphabet. Then FA will have _____ number of transitions in the
diagram.
► (n)+(m)
► (m)(n) OR (n)(m)
►None of the given options
► (m)-(n)

If L1 and L2 are expressed by regular expressions r1 and r2, respectively then the language expressed by r1 +
r2 will be _________
►Regular (Page 10)
►Ir-regular
►Can’t be decided
►Another Language which is not listed here
20

Which statement is true?
►All words are strings (Page 3)
►All strings are words
►Both are always same
►None of these
MIDTERM EXAMINATION

Alphabet S = {a,bc,cc} has _______ number of letters.
►One
►Two
►Three rep
►Four

One language can be represented by more than one RE” this statement is____
►False
►True (Page 9)
►None of these

(a + b)*b is RE for the language defined over S={a,b} having words not ending in a
►True (Page 13)
►False
►Such a language is not regular
►None of these
21

Above given FA accepts ___________ strings defined over S={a , b}

►All (Page 15) rep
►Some
►All but not null
►None of these

►Begins and ends with different letters (Page 24)
►Have length greater than 1
►None of these

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
►TG
►FA
►G and FA (Page 25)
►None of these

If FA1 accepts no string and FA2 accepts many strings, then FA1 + FA2 will be equal to
►FA1
►FA2
►May be both
22

Above given GTG’s are ______________

►Equivalent (Page 27) rep
►Non-equivalent
►Non-valid
Above given NFA and FA generate same language.

►True (Page 41)
►False
►FA & NFA can’t be equivalent
►None of these
Above given structure is a ______________

►FA
►TG
►NFA (Page 44)
►FA and NFA
23

Above given TG has the ______________ RE.

► (a + b)*a
►λ+ (a + b)*a (Page 20)
►None of these
►λ + (a + b)*a*
Above given TG’s are ______________.

►Equivalent (Page 21)
►Non-equivalent
►TG’s are not valid
►None of these
24

Above given FA has _________ RE.
► (a + b)*a (Page 13)
► a(a + b)*
► ((a + b)*a)*
► (a + b)*a & ((a + b)*a)*
Above given TG accepts the _____________ string.

►bb
►baba
►bbba
►all of the given options (Page 19) rep
Above given FA and NFA are equivalent. This statement is ______________.

►False
►FA & NFA can never be equivalent
25

MIDTERM EXAMINATION

If r1 and r2 are regular expressions then which of the following is not regular expression.
►r1 = r2
►r1r2
►r1*
►r1 – r2 (Page 9)

Which of the following is not a word of language EQUAL?
►aaabbb
►abbbabaa
►abababa (Page 5)
►bbbaaa

If S = {aa, bb}, then S* will not contain..
►aabbaa
►bbaabbbb
►aaabbb
►aabbbb

►False
►None of these

“Every Infinite language is regular” this statement is
►False
►Can’t be supposed
►None of these
26

PALINDROME can be defined by more than one regular language
►True
►False (Page 71)
►By only one RE
►Some times By only one RE and Some times False
Above given FA can be expressed as ________

► (a + b)* (Page 19) rep
►a* + b*
► (ab + ba)*
►None of these
Above given FA is drawn using

►Tree structure (Page 18)
►It is not an FA
►Graph structure
►None of these
27


►Contains double a or double b (Page 24) rep
►Contains both a and double b
►Depends on the alphabet
►None of these
aa+bb aa+bb
ab+ba
3- Λ 1 2
ab+ba
Λ
4+
aa+bb
3 Λ 1 X
-
Λ
4
Then what will be
28

Above given NFA-^ accepts____

►bab
►a
►aba
►a & aba rep
Above given structure is a _________________.

►FA
►TG
►FA & TG
►NFA (Page 44)
Above given TG has _____________ RE.

► (aa+aa+(ab+ab)(aa+ab)*(ab+ba))*
► (aa+bb+(ab+ba)(aa+bb)*(ab+ba))* (Page 22)
► (aa+bb+(ab+ba)(aa+bb)(ab+ba))*
►None of these
Above given TG has _______________ RE.

►b(a + b)* (Page 19)
►b*(a + b)*
►b*(a + b)
►None of these
29

Above given two TG’s are _______________.

►Equivalent (Page 26 - 27) rep
►None-equivalent
►Not valid
Above given TG has __________________________ RE.

► (aa+bb+(ab+ba)(aa+bb)(ab+ba))*
► (aa+bb+(ab+ba)(aa+bb)*(ab+ba))* (Page 22) rep
► (aa+ba+(bb+ba)(ab+bb)(ab+aa))*
► (ab+ba+(ab+ba)(aa+bb)(ab+ba))*
30

MIDTERM EXAMINATION

S = {baa, ab}, then S* will not contain
►abbaab
►abab
►baabaa
►abbaa
►True rep
►False
►Sometimes true & sometimes false
►None of these

►False
►None of these

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
►True (Page 14)
►False
►None of these

If a language has RE, then that language can be expressed through TG.
►False
►None of these
31

Above given FA can be expressed by

► (a + b)*a (Page 14)
► (a + b)*b
►a (a + b)*
►b (a + b)*
Question No: 7 ( Marks: 1 ) Please choose one

►False
►None of these
FA3 will express r1r2. then F3 will have ____________________ number of states in its diagram.
►8
►7
►6 (Page 36)
►5

FA1 corresponds to r*, then FA1 must accept _______________ string.
►Every (Page 07)
►Null
►Odd length
►Even length
32

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 (Page 40)
Above given TG accepts the language in which all strings

►Ends in b
►Begins with b (Page 19)
►Ends and begins with b
Above given TG represents the language____

►Begins and ends with different letters (Page 21) rep
►Begins with a
►None of these
33

Above given TG represents the language i.e.

►EVEN-EVEN (Page 22)
►PALINDROME
►FACTORIAL
►None of these

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
►Accepted by FA1 AND FA2
►Accepted by FA1 OR FA2
►Accepted by FA1 AND/OR FA2 (Page 32)
Ref:- language corresponding to r1+ r2 is the union of corresponding languages L1 and L2, consists of the
strings belonging to L1or L2 or both

a (a + b)* is the RE of language defined over S = {a, b} having at least one a
►True
►False
►Such a language does not exist

(a + b)* a is RE for the language defined over S={a,b} having words not ending in b
►True
►False
34

MIDTERM EXAMINATION
CS402- Theory of Automata (Session - 1)

Alphabet S = {a,bc,cc} has _______ number of letters.
►One
►Two
►Three rep
►Four

In which of the following language Rev(s)=s
►EQUAL
►INTEGER
►PALINDROME (Page 6)
►FACTORIAL

If S = {ab, bb}, then S* will not contain
►abbbab
►bbba
►bbbbab
►ababbb
Above given FA generates the language having strings of _________

►ODD length
►EVEN length
►Equal number of a’s and b’s
►None of these
35


►Contains double a or double b (Page 24) rep
►Contains both a and double b
►Depends on the alphabet
►None of these
aa+bb aa+bb
ab+ba
3- Λ 1 2
ab+ba
Λ
4+
aa+bb
3 Λ 1 X
-
Λ
4
+
Then what will be written in place of X.

FA3 expresses r1r2. Then initial state of FA3 will consist of
►Initial state of FA2
►Initial state of FA1 (Page 35)
►Initial states of both FA1 & FA2
►Depends on FA’s
36

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 (Page 35)
►None of these

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 (Page 60)
►May be or may not be

Running the string abbabbba on this Moore machine. The outputs will be________
►101111010 (Page 62)

►01111010
►01011110
►01010101
37

Above given TG’s are ______________.

►None of these
►Equivalent (Page 21) rep
►Non-equivalent
►TG’s are not valid

TG can have more than one initial state.
►True (Page 18)
►False
►Depends on alphabets
►None of these
Above given FA accepts null string.

►True
►False
►FA is not valid
►None of these
38

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 (Page 42) rep
►Either "NFA with null string" OR "NFA with "

One FA has n states and m letters in the alphabet. Then FA will have _____ number of transitions in the
diagram.
► (n)+(m)
► (m)(n) OR (n)(m) rep
► (m)-(n)

(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
39

CS402-Mid Term Solved MCQs With References by Moaaz

Uploaded by

Document Informationclick to expand document information

Document Informationclick to expand document information

Copyright:

Available Formats

CS402-Mid Term Solved MCQs With References by Moaaz

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CS402-Mid Term Solved MCQs With References by Moaaz

Uploaded by

Copyright:

Available Formats

CS402- Theory of Automata genrica

Question No: 1 ( Marks: 1 ) - Please choose one

Question No: 2 ( Marks: 1 ) - Please choose one

Question No: 3 ( Marks: 1 ) - Please choose one

Question No: 4 ( Marks: 1 ) - Please choose one

genrica.com Virtual University

Above given FA can be represented by

Question No: 6 ( Marks: 1 ) - Please choose one

Above given FA accepts ___________ strings defined over Σ={a , b}

Question No: 7 ( Marks: 1 ) - Please choose one

Question No: 8 ( Marks: 1 ) - Please choose one

Above given TG has ____________________ RE.

genrica.com Virtual University

Above given FA accepts the language in which strings

Question No: 10 ( Marks: 1 ) - Please choose one

Question No: 11 ( Marks: 1 ) - Please choose one

Question No: 12 ( Marks: 1 ) - Please choose one

genrica.com Virtual University

Question No: 14 ( Marks: 1 ) - Please choose one

Above given structure is an ________.

genrica.com Virtual University

Question No: 16 ( Marks: 1 ) - Please choose one

Question No: 1 ( Marks: 1 ) - Please choose one

genrica.com Virtual University

Question No: 3 ( Marks: 1 ) - Please choose one

Question No: 4 ( Marks: 1 ) - Please choose one

Question No: 5 ( Marks: 1 ) - Please choose one

Above given FA can be expressed as ________

Question No: 6 ( Marks: 1 ) - Please choose one

genrica.com Virtual University

Above given FA accepts _____________ language.

Question No: 8 ( Marks: 1 ) - Please choose one

Question No: 9 ( Marks: 1 ) - Please choose one

genrica.com Virtual University

Question No: 11 ( Marks: 1 ) - Please choose one

Question No: 12 ( Marks: 1 ) - Please choose one

Above given TG accepts the language in which all strings

Question No: 13 ( Marks: 1 ) - Please choose one

Above given TG has _____________ RE.

genrica.com Virtual University

Question No: 1 (Marks: 1) - Please choose one

Question No: 2 (Marks: 1) - Please choose one

Question No: 3 (Marks: 1) - Please choose one

Question No: 4 (Marks: 1) - Please choose one

genrica.com Virtual University

Given GTG has RE

Question No: 6 (Marks: 1) - Please choose one

NFA accept ______String

Question No:7 (Marks: 1) - Please choose one

NFA accept ______String

Question No: 8 (Marks: 1) - Please choose one

genrica.com Virtual University

Question No:10 (Marks: 1) - Please choose one

Question No: 11 (Marks: 1) - Please choose one

Question No: 12 (Marks: 1) - Please choose one

Question No: 13 (Marks: 1) - Please choose one

genrica.com Virtual University

Question No: 15 (Marks: 1) - Please choose one