This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSE105: Automata and Computability Theory Winter 2011 Homework #2 Due: Thursday, January 20th, 2011 1 2 3 4 a,b a a,b a,b Figure 1: Machine M 1 . Problem 1 Convert the NFA M 1 , given in Figure 1, into an equivalent DFA, using the NFADFA transformation algorithm given in class (and in the textbook). In giving the state diagram for the DFA you obtain, please omit any states that are unreachable from the start state. Problem 2 In class, we showed that swapping the accepting and nonaccepting states of a DFA whose language is L gives a DFA whose language is ¯ L = Σ * \ L . a. Show (by construction) that swapping the accepting and nonaccepting states of an NFA whose language is L does not necessarily give an NFA whose language is ¯ L . Hint: There are examples with a very small number of states. b. Explain, given an NFA whose language is L , how to construct another NFA whose language is ¯ L ....
View
Full Document
 Spring '99
 Paturi
 Formal language, Regular expression, Nondeterministic finite state machine, Kleene star, equivalent orfree expression

Click to edit the document details