We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Looking for Something at Site? Search Below

# CS402 Theory of Automata Current Mid Term Papers May 2011, (Spring 2011)

CS402 Theory of Automata Current Mid Term Papers May 2011, (Spring 2011)

Current Spring 2011 Papers, May 2011 Papers, Mid Term Spring 2011 Papers, Solved Papers, Solved Past Papers, Solved MCQs

Please Share your Current Papers Questions/Pattern here to help each other. Thanks

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Views: 707

### Replies to This Discussion

My today paper on dated 13-5-2011

Most of MCQ comes from previous papers

Question: If a language can be accepted by an FA then it can be accepted by TG as well,

What are the two statement of Kleens’s thermo? [Marks 2]

Question: How can we make FA from a language and also a language from FA? [Marks 2]

Question: Prove the following statement? [Marks 3]

For every Moore machine there is a Mealy machine that is equivalent to it.

Question: There are different ways to prove Kleen’s Thermo Part-III; one method is through union of two FA’s. Name other two methods (Name only)? [Marks 3]

Question: Describe two different method of converting NFA to FA. [Marks 5]

Question: Write down the RE’s for the following language. [Marks 5]

a)      Sigma={0,1} having all possible string except NULL string.

b)      Sigma={0,1} having “0110”  anywhere in the string.

Attachments:
All MCQ's are mostly from the old papers and some are common Not so difficult...

2Q of 2marks
1.can we represent start and final state with + and - sign and is there any other way to represent it??
2Q of 3marks
1.Why we need NFA if Fa is available give solid reasons.
2.makes a RE for a langauge does not have triple b or(bbb) at any place.
2Q of 5marks
1.make FA of and NFA the link of image of NFA is

2. how we can reduce the more then one transitions edges into one transition edge explain with an example.
MID PAPER OF CS402 12/5/2011
THANKS 2 Anjum
why?...................... [3]

Is RE infinite?

An alphabet is concatenation of letters and is also called sigma?

All FA’s are also NFA or not

Any onther way to represent the final (+) and initial(-)
states?..................[2]

A regular language L has only ending with “01” are these belonged to?....[2]

Justify why

“1101” and “111011”

FA1+FA2=FA1UFA2…………………………………………………………………………………….[5]

Explain Moore Machine…………………………………………………………………………..…[5]

CS402

My Today ppr

Multiple choice 20 marks ,,,,

Different between word and strings?  2 marks

What is Transition? 2 marks

Different between Distinguishable strings and indistinguishable strings? 3 marks

Explain Mealy machine ? 3 marks

NFA corresponding to the Closure of an FA    5 marks

TGs: accepting all strings, accepting none, starting with b, not ending in b, containing aa, containing aa or bb…….. 5 marks

All MCQ's are mostly from the old papers and some are common Not so difficult...

2Q of 2marks
1.can we represent start and final state with + and - sign and is there any other way to represent it??
2Q of 3marks
1.Why we need NFA if Fa is available give solid reasons.
2.makes a RE for a langauge does not have triple b or(bbb) at any place.
2Q of 5marks
1.make FA of and NFA the link of image of NFA is...image was given in paper
2. how we can reduce the more then one transitions edges into one transition edge explain with an example.

## HELP SUPPORT

This is a member-supported website. Your contribution is greatly appreciated!

## Latest Activity

30 minutes ago
45 minutes ago
+!!! Slow poison!!! liked Shanzay's discussion Mujhy Tum Yaad Aatay Ho....!!!
52 minutes ago
1 hour ago
+!!! Slow poison!!! liked Shanzay's discussion Darta Hon.....!!!!
1 hour ago
1 hour ago
2 hours ago
2 hours ago

1

2

3