Theory of Computing Homework 13 CS 3810, Fall 2009 Due Friday, Dec 4 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. Please put your name and net id on your homework! 1. Select a topic from the list of topics on the course website beyond finite automata. You may select any topic after the heading context-free languages. Write a half page explanation of your topic that should be understandable to any student in the class. Then create two problems on the topic and work out solutions. These might be used by someone teaching the course as examples. Then create eight more homework exercises that would help a student understand the topic. To illustrate what is intended the following are three write ups by students. DiagonalizationIf we want to compare the cardinalities of two finite sets, we can simply count the elements in each set and compare the number of elements. For infinite sets, such as the set of integers or the set of real numbers, we can compare the cardinalities of two sets by finding a one-to-one correspondence between the elements of the sets. A set is countably infiniteif its elements can be put in one-to-one correspondence with integers. For example, we can create a one-to-one correspondence between the set of all even numbers and the set of all integers. Therefore, the set of all even numbers is countably infinite. Even numbers: 0 2468… Integers: 0 1234… If a set is countable, then we can list the elements of the set or, equivalently, we can put the elements of the set in a table. We can show that certain sets are not countably infinite by diagonalization. For example, diagonalization can be used to show that the set of all real numbers between 0 and 1 is not countably infinite. To do this, try to put all the elements in the following table:
has intentionally blurred sections.
Sign up to view the full version.