Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
15 views2 pages

TAFL Assignment 5

This document is an assignment paper for the Theory of Automata & Formal Languages course at the United College of Engineering & Research for the 2024-25 session. It includes short and long answer questions related to Turing machines, their features, and specific problems to solve. The assignment is due on June 16, 2025, and is worth a total of 20 marks.

Uploaded by

ayugenai01
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views2 pages

TAFL Assignment 5

This document is an assignment paper for the Theory of Automata & Formal Languages course at the United College of Engineering & Research for the 2024-25 session. It includes short and long answer questions related to Turing machines, their features, and specific problems to solve. The assignment is due on June 16, 2025, and is worth a total of 20 marks.

Uploaded by

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

United College of Engineering & Research, Prayagraj

Department of Computer Science and Engineering


Assignment Paper, Session 2024-25

Assignment No.: 5 Semester: IV


Course Name: Theory of Automata & Formal Languages Max. Marks: 20
AKTU Course Code: BCS402
Last Date of Submission: 16/06/2025
Note: All questions are compulsory.

Section-A

Ques. Short Answer Type Questions CO Bloom’s Marks


No. Level
1. What do you mean by basic Turing Machine Model? CO-5 L1 1
2. What do you understand by the Halting Problem? CO-5 L2 1
3. What are the features of Universal Turing Machine? CO-5 1
L1
4. Define the languages generated by Turing machine. CO-5 1

L1
5. Differentiate between Recursive Language and Recursively CO-5 L1 1
Enumerable Language.

Section-B

Ques. Long Answer Type Questions CO Bloom’s Marks


No. Level
1 a) Design a TM to recognize all strings consisting of an equal CO-5 3
number of a’s & b’s.

b) Design a TM to recognize all strings consisting of an odd


number of a’s. L3
2. Construct a TM for the following language:- CO-5 3
L = {anb2n | n ≥1} L3

3. Design a Turing machine to calculate function f(m,n)=m*n , where m CO-5 3


and n are integers. L3
4. Write short notes on variations of Turing Machine. 3
CO-5 L1
5. 3
Explain PCP & Modified Post Corresponding Problem. Does the
following Post Corresponding Problem have a solution?
A= (101, 100, 10, 0, 010), B = (10, 01, 0, 100, 1)

CO-4 L2

CO - Course Outcome

Bloom’s Levels

1- Remembering 2-Understanding 3-Applying 4-Analyzing 5-Evaluating 6-Creating

You might also like