Scribd
Upload
34 views1 page

Automata Theory Assignment-2

This document outlines an assignment on theory of computation. It contains 6 questions asking about deterministic pushdown automata (PDA) vs non-deterministic PDA, universal Turing machines, context sensitive vs context free grammars, designing a Turing machine to compute a sum, recursively enumerable languages accepted by multi-tape Turing machines, and formally defining types of grammars and their corresponding automata.

Uploaded by

himani maheshwari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
34 views1 page

Automata Theory Assignment-2

This document outlines an assignment on theory of computation. It contains 6 questions asking about deterministic pushdown automata (PDA) vs non-deterministic PDA, universal Turing machines, context sensitive vs context free grammars, designing a Turing machine to compute a sum, recursively enumerable languages accepted by multi-tape Turing machines, and formally defining types of grammars and their corresponding automata.

Uploaded by

himani maheshwari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

BCA-C402: Theory of Computation

Assignment-II

1. Define a deterministic PDA. How a DPDA differs from a non-deterministic


PDA?
2. Define a Universal Turing Machine (UTM). With the help of suitable
arguments show the simulation of other Turing machines by a UTM.
3. Compare context sensitive grammar and context free grammar. Can we
design a PDA for context sensitive languages? Justify your answer.
4. Design a TM to find the sum of two numbers m and n. Assume that initially
the tape contains m number of 0s followed by # followed by n number of 0s.
5. Are there any languages which are not recursively enumerable, but accepted
by a multi-tape Turing machine? Justify your answer.
6. Define formally Type 0, Type 1, Type 2 and Type 3 grammar. Show the
corresponding automata for each class

You might also like