+ Link For Assignments, GDBs & Online Quizzes Solution
+ Link For Past Papers, Solved MCQs, Short Notes & More
How to Add New Discussion in Study Group ? Step By Step Guide Click Here.
To learn and understand basic concepts of Context free grammar, regular expression, deterministic and nondeterministic finite automata in building a Lexical analyzer.
Lectures Covered: 1-8
Please read the following instructions carefully before submitting assignment:
For any query about the assignment, contact at firstname.lastname@example.org
BEST OF LUCK
Question No 1: Marks 20
Given the regular expression
a) Construct an equivalent NFA using the Thompson’s Constructions algorithm. (10 marks)
b) Convert the NFA (constructed in part a) to a DFA. (10 marks)
+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)
this assignment is from lecture # 7 & 8
aray koie mujay bataay ga kaya yah sahe banie hai main nay part 1 kie pic
king yh kaisy diagram bnai h smj he ni a rhi ?
Dakhain original pic to upload nhi kar sakta hon na just hints hai yah kay final picture kuch asie hie ho ge kay nhi
king brother plz part b send kar do mery se solve ni ho raha a k liye solve ho jta hai b ki ni niklti
aray yar main nay value nikal lie hain but ab figure kie samaj nhi ah rahie hai kay woh kasay bananie hai :(
this is wrong solution
this is almost 100% correct solution. just add epsilon in last 2 a
Arrow head kahan hai????
@ king, this is wrong solution.