cs402 gdb solution 2021.Dated 10 FEB,2021 Dear Students, GDB of CS402 will be opened on Thursday 18 February. 2021 and it will closed on day of Friday 19th February. 2021. Students must Submit their responses on time to avoid any inconvenience.
Graded Discussion Board: For formal language*. Noam Chomsky identified formal grammar* into four categories known at 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 !. (a b . d n>I) They have limited memory resource for the implementation.
Discuss which machine among FA (Finite Automata). PDA (Push Down Automata). LBA (Linear Bounded Automata) and TM (Turing Machine) i* the most favorable one for the
By keeping in mind the above Scenario above language as a function of n” and limited memory resources Give proper reasoning. Studenst must Read instructions which are given below carefully before sending your comments:
1- Students discussion must be based on logical facts and in depth knowledge of topic is must for that.
- Comments of students must be relevant to the topic that is clear and concise (Maximum Four to five line (4-5) lines answer)
- Students must post their comments on Graded Discussion Board and not on the Regular MDB (Moderate discussion boeard) Both will run parallel to each other during the time specified above
- l Books, websites and other reading material may be consulted before posting your comments –
- GDB • ill have weight-age of 5% of your total subject marks
- There is extra time will be given for discussion
- Students does not participate in the discussion after the due date or through e-mail
cs402 gdb solution 2021