CS402 Theory of Automata Assignment 2 solution Fall 2012

CS402 Theory of Automata Assignment 2 solution Fall 2012

Theory of Automata (CS402)

 Total marks = 20

Deadline Date = Nov 14, 2012

Q. 1.Marks [10]

Suppose we have a Transition Graph (TG) as follows:

Derive regular expression for the above transition graph. Briefly explain each and every step.

Solution:

THIS IS THE FINAL ANSWER TO COMPARE WITH YOUR SOLUTION

PLEASE DO THE REST YOURSELF

Q. 2. Marks [10]

Develop a Finite Automaton (FA) corresponding to the union of above two FAs.

Solution:

THIS IS THE FIRST PART YOU ONLY HAVE TO DRAW THE FA(FINITE AUTOMATA)

PLEASE DO THE REST YOURSELF IS EASY.