Theory of Automata (CS402)
Assignment # 2
Total marks = 20
Deadline Date = Nov 14, 2012
Q. 1. Marks 
Suppose we have a Transition Graph (TG) as follows:
Derive regular expression for the above transition graph. Briefly explain each and every step.
THIS IS THE FINAL ANSWER TO COMPARE WITH YOUR SOLUTION
PLEASE DO THE REST YOURSELF
Q. 2. Marks 
Develop a Finite Automaton (FA) corresponding to the union of above two FAs.
THIS IS THE FIRST PART YOU ONLY HAVE TO DRAW THE FA(FINITE AUTOMATA)
PLEASE DO THE REST YOURSELF IS EASY.
DOWNLOAD SOLUTION HERE