Shinnu Jangra TOC-Assigment-3 Submission Date: 30-Nov-2022

Assignment-3
Semester III

Roll No:
Date:
Department:
Title of the Course:
TOC
Course Code:

Section - A
Q.1 Define PDA and types of PDA?

Q.2 Applications of PDA explain with examples?

Q. 3 What are the rules of Context Sensitive Grammar and also explain CSL Language with example?

Q. 4 Check the given grammar is ambiguous or not?

Q. 5
Q. 6

Q. 7

Solution:
Q. 8
Q. 9 Construct a PDA for language L = {0n1m2m3n | n>=1, m>=1}

n m
Q. 10 Construct a PDA for language L = {0 1 | n >= 1, m >= 1, m > n+2}

Q. 11 Explain Turing Machine with example?

Q. 12 What are the difference between FA, PDA and Turing Machine explain with example?

Q.13 Define Recursively Enumerable and Recursive Languages?

Q. 14 Define Time and Space complexity and how to calculate the time complexity of any problem
explain with example?

Q. 15 Define complexity classes with examples?

Q. 16 Power of TM

Solution:

Q. 17
Q. 18 Construct a TM for the language L = {0n1n2n} where n≥1?

Q.19 Construct a TM machine for checking the palindrome of the string of even length?

Q .20 Construct a TM machine for checking the palindrome of the string of odd length?

Q.21 Construct TM for the addition function for the unary number system?

Q.22 Construct a TM for subtraction of two unary numbers f(a-b) = c where a is always greater than b?

Q. 23 Define Undecidability of Universal Languages about TM?

https://www.javatpoint.com/undecidable-problem-about-turing-machine