*~* VuPak2009 *~* Some one help me in Construction of Nondeterministic finite automata (NFA) for regular expression??????

Construct Nondeterministic finite automata (NFA) for regular expression (a* | b*)* using
Thompson's Construction Algorithm. Show the sequence of moves in processing the input string
"ababbab".


--

ALLAH RAB UL IZZAT ne farmaya "Agar main ne tamam batain qismat main likhni hotin to main apne bande ko Dua mangna na sikhata".

Hazrat Muhammad (SAW) na farmaya:-
Apni taqdeer ka her faisla ALLAH PAK k hath ma da do, os sa dua to karo per zid na karo, qk jab tm ALLAH per apni zindagi ka faisla chorhta ho to ALLAH be wahi karta ha jo tumhari kushi hoti ha.....JAZAK ALLAH

       

Sweet Pari
BSCS 5th Semester

--
You received this message because you are subscribed to the Google Groups "Virtual University of Pakistan 2009" group.
To post to this group, send email to virtual-university-of-pakistan-2009@googlegroups.com.
To unsubscribe from this group, send email to virtual-university-of-pakistan-2009+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/virtual-university-of-pakistan-2009?hl=en.