CS301: Theory of Automata

Assignment # 1
Due on Monday 11th Sept, 2017 at 3:00 pm
Submission Guidelines:
Submit your handwritten document directly to the designated Lab Instructor/T.A
Write your Name, Roll No and Section in front
Plagiarism is heavily penalized and so are late submissions.

1) Provide recursive definition of language defined over alphabet = {1, 2}, having all strings
starting with 22 or ending with 11
2) Provide recursive definition of language defined over alphabet = {x, y}, having all strings
with length multiple of 2
3) Provide recursive definition of language defined over alphabet = {a, b}, having all strings
not ending with aa or bb
4) Provide recursive definition of language defined over alphabet = {x, y}, not having xy at
any place.
5) Provide recursive definition of odd palindrome (Palindrome with odd strings only) defined
over alphabet = {a, b}