Scribd
Upload
24 views1 page

TOA Assignment 04

The document outlines an assignment with 4 questions. Question 1 asks to write 10 strings in a language and draw a Turing machine transition table for the language. Question 2 asks to draw Turing machines comparing strings of equal, greater than, and less than lengths. Question 3 asks to draw a Turing machine for a language and perform a derivation. Question 4 asks similar comparisons to Question 2 but for numeric values.

Uploaded by

ons792
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
24 views1 page

TOA Assignment 04

The document outlines an assignment with 4 questions. Question 1 asks to write 10 strings in a language and draw a Turing machine transition table for the language. Question 2 asks to draw Turing machines comparing strings of equal, greater than, and less than lengths. Question 3 asks to draw a Turing machine for a language and perform a derivation. Question 4 asks similar comparisons to Question 2 but for numeric values.

Uploaded by

ons792
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

TOA (Assignment 04)

Total Marks: 40
Due Date: 08 July 2024

Instructions:

1. This is your individual handwritten assignment (Scan it and submit on portal, Bring
the hard-form in coming class).
2. Your assignment should be plagiarism free. In case of plagiarism,
straight Zero would be rewarded.
3. You have to attempt all the questions of the assignment.
4. No late submissions would be entertained in any case.
Q # 01:

𝐿 = {𝑎i 𝑏j 𝑐k | i>j>k }
a. Write at least 10 strings of the above language in increasing order of string length.
b. Draw a Turing machine for the above language, also make transition table.

Q # 02:

𝐿 = {𝑎n 𝑏m}
i) n=m ii) n>m iii) n<m
a) Draw Turing machines for the above language by considering each comparison of m and n,
separately.
b) Considering part (a), now combine all three comparison machines into one machine.

Q # 03:

𝐿 = { wwr ; w belongs to {a,b}* }


a) Draw Turing machines for the above language.
b) Using this string(baabbaab), perform the derivation.
Q # 04:

𝐿 = {numeric number comparison by unary operation; a,b belongs to natural numbers }


i) a=b ii) a>b iii) a<b
a) Draw Turing machines for the above language by considering each comparison of a and b,
separately.
b) Considering part (a), now combine all three comparison machines into one machine.

You might also like