Welcome to Join VU Students Community of Virtual University's largest social network .We hope you & we all will be well benefited by study materials shared by all of us...we are waiting for your contributions also.thanx.

ASSALAM-O-ALAIKUM
if u need any kind of help about ur course; handouts, past papers material, quiz solving techniques and paper solving techniques, GDB's, and assignments and how can u use ur lms account? then u can ask about it 4rm Vuning Group members. thnx
click this link below, this is a group for students help and join it. it will b helpful for students if u wants to join this group to niche members must b approved mein is option ko click kren (click here to request access from the Group Creator)-uske baad send request to the creator. invite ur vu friends and also promote it
http://vustudents.ning.com/group/vuhelpcenter

and also
join vustudents ning study group and invite ur vu fellows (add people to group)
this is urs helping group
see right side below the pic then clik on join it
thnx
https://www.facebook.com/groups/vustudents.ning/

slam dear aap kia hal ha?

Welcome HUMMA on ning

W/s

thanx

same to you

here is the idea solution of cs 402

bt some of the diagrams can't paste here

We draw a Finite Automaton (FA) in the following manner: The machine’s states are represented by circles and transitions are represented by  arrows.  Every transition is marked by a symbol from the alphabet .  The start state is marked by  a – sign  and the final states are marked by a + sign as shown in the FA for   a* b a*.

We draw another  finite automaton which accepts all strings from  a*bb*a a*(b a*bb*a a*)*.

The Transition graph that accepts only the empty word is,

Now by reversing an edge of "a" the above transition graph accepts the languagea^*

            The resultant TG is