Homework_2

# Homework_2 - 1 1 0 10 1| 1 01 0 10 1| 1*0*1 n n n n n n ≥...

This preview shows page 1. Sign up to view the full content.

Theory of Computing Homework 2 CS 3810, Fall 2009 Due Friday, September 11 General guidelines: You may work with other people, as long as you write up your solution in your own words and understand everything you turn in. Make sure to justify your answers—they should be clear and concise, with no irrelevant information. Each problem should be submitted on a separate piece of paper. Please put your netid on your homework! 1. Describe the set { }
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: { } 1 1 0 10 1| 1 * 01 0 10 1| 1 *0*1 n n n n n n + + ≥ ≥ I ? Are there any strings with an odd number of blocks of zeros? 2. Consider the set of all functions mapping integers to {0,1} and the set of all functions mapping integers to {0,1,2,3}. Are these two sets the same cardinality? To show that they are the same cardinality, give a one-one mapping of elements of the two sets. 3. 2.2.5 a and d 4. 2.2.6 a 5. 2.3.4 6. 2.3.3...
View Full Document

## This note was uploaded on 11/07/2009 for the course CS 3810 taught by Professor Hopcroft during the Fall '07 term at Cornell.

Ask a homework question - tutors are online