Scribd
Upload
825 views6 pages

Theory of Automata - CS402 Mid Term Paper

The document contains 12 multiple choice questions from a CS402 Theory of Automata midterm exam covering topics like finite automata, regular expressions, grammars, and Moore machines. The questions test understanding of concepts like language properties generated by automata, equivalence of machines, initial and final states, and outputs of Moore machines on given input strings.

Uploaded by

ZahidShah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
825 views6 pages

Theory of Automata - CS402 Mid Term Paper

The document contains 12 multiple choice questions from a CS402 Theory of Automata midterm exam covering topics like finite automata, regular expressions, grammars, and Moore machines. The questions test understanding of concepts like language properties generated by automata, equivalence of machines, initial and final states, and outputs of Moore machines on given input strings.

Uploaded by

ZahidShah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

CS402 Midterm Paper - Theory of Automata Midterm Examination

www.vuzs.net

CS402 - Theory of Automata - Question No: 1

Alphabet S = {a,bc,cc} has _______ number of letters.


One
Two
Three
Four

CS402 - Theory of Automata - Question No: 2

In which of the following language Rev(s) =s


EQUAL
INTEGER
PALINDROME
FACTORIAL
www.vuzs.net
CS402 - Theory of Automata - Question No: 3

If S = {ab, bb}, then S* will not contain


abbbab
bbba
bbbbab
ababbb

CS402 - Theory of Automata - Question No: 4

Above given FA generates the language having strings of _________


ODD length
EVEN length
Equal number of as and bs
None of these

CS402 - Theory of Automata - Question No: 5

Above given GTG accepts the language in which strings


Contains double a or double b
Contains both a and double b
Depends on the alphabet
None of these

CS402 - Theory of Automata - Question No: 6

Then what will + written in place of X.be


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

CS402 - Theory of Automata - Question No: 7

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 FAs

CS402 - Theory of Automata - Question No: 8

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

CS402 - Theory of Automata - Question No: 9

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

CS402 - Theory of Automata - Question No: 10

Running the string abbabbba on this Moore machine. The outputs will
be________

101111010
01111010
01011110
01010101
www.vuzs.net

CS402 - Theory of Automata - Question No: 11

Above given TGs are ______________.


None of these
Equivalent
Non-equivalent
TGs are not valid

CS402 - Theory of Automata - Question No: 12

TG can have more than one initial state.


True
False
Depends on alphabets
None of these

You might also like