CS-73 : Introduction to Computer Organisation Dec-2004
Question Paper of CS-73 : Introduction to Computer Organisation Dec-2004
Q.l(a) State the operations under which each of the following classes of languages are closed.
(i) Languages accepted by Finite Automata
(ii) Languages accepted by Pushdown Automata
(b) What is the difference between an NP-complete language and an NP-hard language? Give an example of a language which is NP hard and not NP-complete. Justify your choice of example.
© Give a regular expression for the language accepted by the above FA. Describe the language.
(d) Prove that a context free language is recursive.
(e) Construct a Moore machine equivalent to the following Mealy machine.