Generate KERALA UNIVERSITY Class 4 formal languages and automata theory Question Paper
Create exam-ready question papers instantly using ZenQB AI. Perfect for teachers and students.
Sample Questions
- (b) Design a Turing machine that computes a function $f(m, n)=m \div n$, i.e. proper subtraction of 2 integers defined as $m \div n$ if $m>n$ and 0 otherwise.
- Design a Turing machine to multiply two numbers.
- (a) Explain Universal Turing machine.
- (b) Remove useless symbols of the CFG given below and convert to Chomsky Normal form. $s \rightarrow 0 A 0 / 1 B 1 / B B \quad A \rightarrow C \quad B \rightarrow S / A \quad C \rightarrow S / \vareps...
- (b) Describe Chomsky hierarchy. ..... 10 OR