иαвєєℓ αнмє∂ added a discussion to the group CS402 Theory of Automata

иαвєєℓ αнмє∂ added a discussion to the group CS402 Theory of Automata
Thumbnail

CS402 GDB CS402 will be opened on Thursday 18th February, 2021 and it will be closed on Friday 19th February, 2021.

GDBDated:Feb 10, 21Dear Students,Graded Discussion Board (GDB) of CS402 will be opened on Thursday 18th February, 2021 and it will be closed on Friday 19th February, 2021.Submit your responses on time to avoid any inconvenience.Graded Discussion BoardFor 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.Read the following instructions carefully before sending your comments:Your discussion must be based on logical facts and in depth knowledge of topic is must for that.Your comments should be relevant to the topic i.e. clear and concise. (Maximum 4-5 lines answer).You should post your comments on Graded Discussion Board & not on the Regular MDB. Both will run parallel to each other during the time specified above.Books, websites and other reading material may be consulted before posting your comments.GDB will have weight-age of 5% of your total subject marks.No extra time will be given for discussion.You cannot participate in the discussion after the due date or through e-mail.See More


from Latest Activity on Virtual University of Pakistan https://ift.tt/3b6wSSj

0 comments:

Post a Comment