Showing posts from July 4, 2010

Example of Finite Automata

B. H. Gardi College of Engineering and Technology MCA Semester - II Subject: 620007 - Theory of Computation Unit - II Important Question
DFA for Language L1 and L2 are given as follow
Figure – I: DFA for Language L1
Figure – II: DFA for Language L2
       Find out. (a) L1 U L2, (b) L1 ∩ L2, (c) L1 – L2
Common Diagram For All three Question

(a)L1 U L2
-In Figure - I ‘C’ is FinalState and In Figure -II ‘Z’ is FinalState, So All the State Containing Either ‘C’ or ‘Z’ becomes a FinalState. -