This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: a = [1,2,3 ] a[4] = 5 # OUTPUT = a.each{ x puts #{x} } 2. (4 pts) Is it true that every DFA is a NFA? Explain your answer. 3. (4 pts) Write a DFA that accepts the language 1(001)*. You do not need to use the algorithms described in class. 4. (8 pts) Begin converting the following NFA into a DFA by applying the subset construction algorithm discussed in class. You do not need to produce the entire DFA. Create at least 2 DFA states (starting state & additional state) and the transition (with label) connecting them. Be sure to list the NFA states represented by each DFA state. 1 3 a b 4 5 2 6...
View
Full
Document
 Fall '08
 staff

Click to edit the document details