This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: University of Virginia - cs3102: Theory of Computation Spring 2010 PS2 Due: 16 February 2010 (2:00pm) This problem set covers material in Sipser Chapter 1, focusing on Sections 1.2 and 1.3, and sections 2.1 and 2.2 of Chapter 2. Answer all ten questions (5f is an optional challenge question). For full credit, answers must be concise, clear, and convincing, not just correct. You are strongly encouraged to use LaTeX to produce your submission, and we have provided a LaTeX template to assist with this. You may, however, handwrite your an- swers so long as your writing is legible and easily interpreted . For full credit, answers must be concise, clear, and convincing, not just correct. Collaboration Policy. For this assignment, we will follow the same collaboration and resource policy as on Problem Set 1. See the Problem Set 1 handout for a full description of the policy. Pledging. It is not necessary to scribble a pledge on your submission: we assume all students are honest and honorable regardless of whether or not you scribble a pledge on your submission. If you are dishonorable, however, please write a note on your submission indicating this. If you want to write a pledge, please write something meaningful like, with honor, not something rote and meaningless like pledge. Problem 1: Constructing NFAs. For each of the following languages, draw an NFA that recognizes the language using fewest possible number of states . For all languages,....
View Full Document
This note was uploaded on 04/05/2010 for the course CS 150 taught by Professor Humphreys,g during the Spring '08 term at UVA.
- Spring '08