This preview shows page 1. Sign up to view the full content.
B501  Theory of Computation – Spring 2010
Instructor A. Flammini
The assignment is due in class on Wed. April, 7th
For each of the following problems:
A.
Express the problem as a language
B.
Give a highlevel description of a TM that decides the language of point 1. Explain in few
sentences how the machine works.
I am expecting answers with the level of detail as those in the examples discussed in chapter 4 of the
book. In particular, e.g. you can use EQ
DFA
as part of the deciders you are asked to describe below. Each
question is worth 5 points.
1. Given two DFAs, M
1
and M
2
,
whose alphabet is ∑={0,1} consider the problem of deciding whether
there exists a string that is not accepted by either machine.
2. Given a DFA M
whose alphabet is ∑={0,1} consider the problem of deciding whether the machine
accepts at least one string
that contains “11” as a substring.
3. Given a DFA M
whose alphabet is ∑={0,1} consider the problem of deciding whether the machine
accepts all strings
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.
 Spring '11
 sm

Click to edit the document details