Please Discuss here about this assignment.Thanks
Our main purpose here discussion not just Solution
We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.
finaly i have done this assignment and now submit
second question main transition diagram bna k fa bnana ha
transition diagram rule
1. FA1 ki initial stat corresponding FA ki initial stat ho gi
2. FA1 and FA2 ki final stat corresponding FA ki b final stat ho gi
3.sequence sy a r b ki transitions check kr k corresponding fa py apply krna ha
sitara saddique plz upload idea solution so that other students also can get help.
GOD BLESS U
sir 4 second question listen lecture 17 and for first lecture 16
Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....
Assignment No. 02 Total Marks:20
Semester: Fall 2015
Theory of Automata – CS402
Objective of this assignment is to assess the understanding of students about Finite Automata (FA), Non-deterministic Automata (NFA) and Union of FA’s.
Please read the following instructions carefully before submitting assignment:
Note: No assignment will be accepted after the due date through email in any case (load shedding, server down, internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least one day before its closing date.
For any query about the assignment, contact at firstname.lastname@example.org
Question No 1: Marks: 10
Convert the given Non-deterministic Finite Automaton (NFA) into a Finite Automaton (FA).
Question No 2: Marks:10 10
Draw a transition table and the corresponding Finite Automaton (FA) for the union of following two FAs.
BEST OF LUCK
mjhy es subject main bht problem h. anyone help me????
see first q transition diagram check and find error is it true or false
Salam, ur transition table seems fine to me.
However, You marked Z5 as a final state, please correct me if i am wrong but i feel that Z5 can't be marked as final place since it only consist of stage 3 from original NFA which is not a final stage (only final stage in original NFA is stage 2).
Hopefully i explained my point well... Plz share ur input.
thank you telling me my mistake u r right z5 is a not a final stat