[zaini mughal]

Dear Students,

Graded discussion (GDB) will be launched on Thursday 9th August, 2018 and it will remain open for two days. You can post your comments on the below mentioned topic till Friday 10th August, 2018.
and the given topic is ..!
Theory of automata is the study of abstract machines, as well as learning of computational problems that can be solved using them. It is a theory in theoretical computer science and discrete mathematics (a subject of study in both mathematics and computer science).  It is considered to be the study of machines like Turing machine, Finite state machine, Pushdown Automata etc. By keeping in mind the concepts of automata, you have to elaborate the role of Push down Automata (PDA) and Turing Machine in Formal Language Processing and which one is better in both to them? Justify your answer with proper reason.  

A concise and to the point comment is preferred over lengthy comments having irrelevant details. Your comment must not be more than 5-6 lines. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. For any queries please email at cs402@vu.edu.pk.

Good Luck!

[fahadmukhtar]

solution kahan ha

[zaini mughal]

solution kahan ha

mene solution hi ka pucha hai bhai es website py khud solution dala nhai hai

---

solution kahan ha

mene solution hi ka pucha hai bhai es website py khud

Cs402 gdb idea solution
Turning machines are all the more ground-breaking that PDAs. The most straightforward 
illustration would be demonstrate that the turning machine can depict setting delicate dialects. It 
is the key hypothesis of the theory of automata and can be demonstrated in many number of ways. 
For instance, ending issue for turning machines are undecidable. There is no program gives rectify 
yes no response to the inquiry and TM on this info stopped. In any case, PDAs ending issue is 
feasible.
In any case, Two Pushdown automata cooperating can reproduce a turning machine. We need to 
indicate the significance of two PDAs cooperating - they both associated with the information 
string and each can work with its stacks freely of the other. Their limited state controls are likewise 
associated, or identically, converged into a singled limited state control.

[alimagsi]

Asslam-o-alaium 
Dear Friends !
I attech Below Solution file. 
Download it.