Introduction to the Theory of Computation

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Theory of Computation -- CSE 105 Computability Homework 3 Homework 3: The solutions to the following problems should be turned in class by July 30, 1999. 1. Let is a DFA which doesn't accept any string containing an odd number of 1s . Show that is decidable. 2. Show that is undecidable. and are Turing Machines and 3. Give an example in the spirit of the recursion theorem of a program in a real programming language (or a reasonable approximation thereof) that prints itself out. 1 8 $ 4 976%" 5 ) 3" '0" @ 6) 4 $21 0("'%#"! " ) &$ ...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online