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

Scribd
Upload
35 views1 page

Assignment # 04 (Individual Effort, 20 Points) : Tuesday, Jun 01, 2020

This document contains an assignment for an advanced theory of computation class consisting of two questions. The first question asks students to construct a Turing machine to check for palindromes of even length strings and provide a formal definition. The second question asks students to do the same for odd length strings. Both questions are worth 6 points for the machine and 3 points for the formal definition. The assignment is due on June 1, 2021 and notes that only scanned copies or photos of handwritten work will be accepted, with 10% of points going towards neatness.

Uploaded by

khadija sipra
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
35 views1 page

Assignment # 04 (Individual Effort, 20 Points) : Tuesday, Jun 01, 2020

This document contains an assignment for an advanced theory of computation class consisting of two questions. The first question asks students to construct a Turing machine to check for palindromes of even length strings and provide a formal definition. The second question asks students to do the same for odd length strings. Both questions are worth 6 points for the machine and 3 points for the formal definition. The assignment is due on June 1, 2021 and notes that only scanned copies or photos of handwritten work will be accepted, with 10% of points going towards neatness.

Uploaded by

khadija sipra
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

Subject: CS850 Advanced Theory of Computation Due Date: Tuesday, Jun 01, 2020

Class: MSCS-2K20 Semester: Spring 2021

Assignment # 04 (Individual Effort, 20 points)


Question#1: Construct a Turing machine for checking the palindrome of the string of even length
and write its formal definition. (6+3pts)

Example strings are:


ababbaba
abbaabba
babaabab
etc.

Question#2: Construct a Turing machine for checking the palindrome of the string of odd length and
write its formal definition. (6+3pts)

Example strings are:


abababa
aaabaaa
etc.

Note: 10% points are reserved for neatness! Only Scanned copies or photos of the hand-written
assignments will be accepted. Hard copy submissions are not allowed.

You might also like