COMSATS Institute of Information Technology Lahore
CSC312 – Automata Theory (Sec-ABC) – Assignment 4
Monday, Dec. 21, 2015
Name: ___________________ Reg. No. ___________________
Time: 50 hours Max. Marks: 30
Qno.1: Construct The PDA and Turing Machines from the Given statements of Language over the alphabet set { a b} . (5X3=15)
- Build a machine that accepts all the strings that have an even length and also not divisible by 6.
- Language of all those string which do not end by ba.
- Language of all those strings that accepts only the words baa,ab and abb.
- Language of all those strings that contains even number of substring ab.
- Language of all those strings of a’s and b’s such that the next to the last letter is an a
Deadline 23 December at 1200 Hours
…………………………….Best of Luck…………………………………….