This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: The alphabet is the same as the original DFA for A. The starting states is the new state q0. The accepting state for the DFA for A R is the original starting state for the DFA for A, q. ' has all the arrows from the original transition arrows, except they are all reversed. In addition, there are transitions from q0 to all of the original accepting states of the DFA for A, F. This ensures that there is only one starting state for the DFA for A R ....
View
Full
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