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.
Instructions for Posting GDB Comments
- You need to provide precise and to the point answer, avoid irrelevant details.
- Copy from the internet or other student will get zero marks.
- You should post your answer on the Graded Discussion Board (GDB), not on the Moderated Discussion Board (MDB). Both will run parallel to each other during the specified time. Therefore, due care will be needed.
- You need to use font style as “Times New Roman” and font size 12.
- You cannot participate in the discussion after the due date via email.
- The GDB will open and close on specified date and time. Please note that no grace day or extra time will be given for posting comments on GDB.
Solution:
Answer is Uploaded Soon please Connect with us
