hw2 - is never visited twice Part C Every DFA-acceptable...

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

View Full Document Right Arrow Icon
ECS 120: Introduction to the Theory of Computation Homework 2 Problem 1. Given a DFA M = ( Q, Σ ,δ,q 0 ,F ), prove that if ˆ δ ( q,xz ) F and ˆ δ ( q,yz ) 6∈ F then ˆ δ ( q,x ) 6 = ˆ δ ( q,y ), for x,y,z Σ * . Problem 2. Find the smallest (in terms of number of states) DFA for the language L = { 01 * 0 } . Prove that there is no DFA smaller than yours. Problem 3. Part A. Every DFA-acceptable language can be accepted by a DFA with an even number of states. Part B. Every DFA-acceptable language can be accepted by a DFA whose start state
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: is never visited twice. Part C. Every DFA-acceptable language can be accepted by a DFA no state of which is ever visited more than once. Part D. Every DFA-acceptable language can be accepted by a DFA with only a single final state. Problem 4. Give two substantially different proofs of the following: if L 1 and L 2 are DFA-acceptable then L 1 ⊕ L 2 = { w : w is in exactly one of L 1 and L 2 } is DFA-acceptable. 1...
View Full Document

This note was uploaded on 04/29/2010 for the course ECS 222 taught by Professor Mr. during the Spring '10 term at UC Davis.

Ask a homework question - tutors are online