0% found this document useful (0 votes)
14 views1 page

Assignment3

This document outlines Assignment 3 for a course on Formal Languages and Automata Theory, due on August 31, 2020. It consists of three exercises focusing on Turing machines, including designing a Turing machine to recognize and enumerate a specific language, using a Turing Machine Simulator, and constructing a modified Turing machine. Each exercise is worth 10 marks, totaling 30 marks for the assignment.
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
0% found this document useful (0 votes)
14 views1 page

Assignment3

This document outlines Assignment 3 for a course on Formal Languages and Automata Theory, due on August 31, 2020. It consists of three exercises focusing on Turing machines, including designing a Turing machine to recognize and enumerate a specific language, using a Turing Machine Simulator, and constructing a modified Turing machine. Each exercise is worth 10 marks, totaling 30 marks for the assignment.
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/ 1

CS304 Assignment 3

Formal Languages and 28th August 2020


Automata Theory
Assignment 3
(30 marks, submit by Monday, 31st August midnight)

Exercise 7 Turing-Enumerator (10 marks)

Let L = {w ∈ {a, b}∗ | w is of even length}.

(a) Design a Turing machine which recognizes L.

(b) Design a Turing machine which recursively enumerates L. Recall that such a Turing ma-
chine has no input but prints the words on an output tape. You may assume several
other tapes. (Hint: see the video on recursively enumerable languages.)

Exercise 8 Turing Machine Simulator (10 marks)

(a) Learn to operate the Turing Machine Simulator found at http://morphett.info/turing/turing.html.


What kind of Turing machine does it simulate?

(b) Familiarize yourself with the examples programs.

(c) Simulate the subroutine program you have written for the previous exercise on different
input strings. Submit your code.

Exercise 9 Turing Machine Design (10 marks)

Let M be a Turing machine not necessarily halting on every input. Construct Turing machine
M 0 which halts on w if ww ∈ L(M) and does not halt otherwise.

You might also like