cs373 fa10 hw1 - CS 373: Theory of Computation Assigned:...

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

View Full Document Right Arrow Icon
Problem Set 1 CS 373: Theory of Computation Assigned: August 31, 2010 Due on: September 7, 2010 Instructions: This homework has two parts. The first part has practice problems from the textbook many of whose solutions can be found in the textbook itself; you must not turn in solutions for these. The second part has 3 problems that can be solved in groups of size at most 3. Please strictly follow the homework guidelines given on the class website; submitions not following these guidelines will not be graded. Recommended Reading: Lectures 1 through 3 and pages 1 through 44 of class textbook. Practice Problems Solve problems 0.1, 0.2, 0.3, 0.13, 1.1, and 1.2 of class textbook. Homework Problems Problem 1 . [Category: Comprehension+Proof] Consider the following DFA M 0 over the alphabet { 0 , 1 } . A B C D 0 1 1 0 1 0 0 , 1 Figure 1: DFA M 0 for Problems 1 and 2 1. Describe formally what the following are for automaton M 0 : set of states, initial state, final states, and transition function. [2 points] 2. What are
Background image of page 1

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

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

Page1 / 2

cs373 fa10 hw1 - CS 373: Theory of Computation Assigned:...

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