Skip to main content

CS402 GDB Fall 2020 Solution

Image
By

 Graded Discussion Board

For formal languages, Noam Chomsky identified formal grammars into four categories known as Chomsky Hierarchy. For each grammar, there is an automaton accepting it.

A mathematicians group at Hopkins University, California needs a machine to implement a language L derived after some calculations where L={an bn cn dn , n≥1}. They have limited memory resources for the implementation.

Discuss which machine among FA (Finite Automata), PDA (Push Down Automata), LBA (Linear Bounded Automata) and TM (Turing Machine) is the most favourable one for the scenario by keeping in view the above language as a function of ‘n’ and limited memory resources. Give proper reasoning.


Solution

Turning machine is the most favorable one for the scenario by keeping in view the above language as a function of ‘n•’ and limited memory resources.

Turning Machine (TM)

For solving any recursively enumerable problem. For the implementation of neural networks.

For the implementation of Robotics Applications. For the implementation of artificial 

Labels:

Comments

Post a Comment

Popular posts from this blog

IT Intern (Microsoft Product)

By
For more discuss and ask question join this group   https://www.facebook.com/groups/143792885956764/ Solved   By : Tahir Siddiqui(Mani) BC-140201235@Vu.edu.pk Job Description We offer Internship in IT 03 months Unpaid internship Responsible for Managing IT Products/Services. Maintains relationships with clients by providing support, information, and guidance. Good presentation skills. Good oral & written communication knowledge of MS Office 50%. Traveling Required Team Work Candidate must have a Motor Bike and laptop. Fresh candidates are encouraged to apply. Job Details Industry: Information Technology ...
5 comments
Read more

cs304 Assimgt 2 2016

By
Assignment No. 02 Semester: Spring  2016 Object Oriented Programming – CS304 Total Marks: 20 Due Date: July 21, 2016 Objectives: To get a hands on experience of using existing class as base class and implement inheritance. Instructions: Please read the following instructions carefully before submitting assignment: It should be clear that your assignment will not get any credit if: §   The assignment is submitted after due date. §   The assignment is submitted via email. §   The assignment is copied from Internet or from any other student . §   The submitted assignment does not open or file is corrupt. §   It is in some format other than .cpp (Code File). Note: All types of plagiarism are strictly prohibited. For any query about the assignment, contact at CS304@vu.edu.pk Case Study With the technological innovation, th...
5 comments
Read more