2001a1 - COSC 2001: Introduction to the theory of...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: COSC 2001: Introduction to the theory of computation Assignment 1 (Released January 18, 2006) Submission deadline: 6:45 pm, Jan 31, 2006 1. The assignment can be handwritten or typed. It MUST be legible. 2. You may do this assignment individually or in groups of two. If you work in a group, hand in only one copy of the solutions. 3. Submit this assignment only if you have read and understood the policy on academic honesty on the course web page. If you have questions or concerns, please contact the instructor. 4. Use the dropbox near the main office to submit your assignments. No late submissions will be accepted. Question 1 Design a DFA for the language L given by L = { w | w { , 1 } * ,w ends in 0 and does not contain the substring 11 } . Try to use as few states as you can. Question 2 Suppose M 1 = ( Q 1 , ,q 1 ,A 1 , 1 ) and M 2 = ( Q 2 , ,q 2 ,A 2 , 2 ) accept languages L 1 ,L 2 respectively....
View Full Document

Page1 / 2

2001a1 - COSC 2001: Introduction to the theory of...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online