Unformatted text preview: 1.31) Given M is some FA that recognizes A, we can construct an FA that recognizes AR (call this MR) 1. Start with M 2. Reverse the direction of all state transistions in M 3. The accepting state of MR is the start state of M 4. Create a new start state q0, which is linked to all of M's accepting states via epsilon transitions 5. MR now recognizes AR; MR recognizes a regular language; AR is a regular language...
View Full Document
- Spring '08
- Regular expression, Regular language, Chomsky hierarchy, start state, new start state