This preview shows pages 1–7. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: state to every other state and also from each state to itself 5. Instead of being labeled with symbols from the alphabet, transitions are labeled with regular expressions Converting a GNFA to a RE • If the GNFA has two states, then the label connecting the states is the RE • Otherwise, remove one state at a time without changing the language accepted by the machine until the GNFA has two states Removing one state from a GNFA a 13 a 32 a 12 a 33 q 2 q 1 q 3 q 1 ’ q 2 ’ a 12 ∪ a 13 a 33 * a 32 These two portions of GNFA’s recognize the same strings Accounting for loops a 11 ∪ a 13 a 33 * a 31 q 1 ’ q 2 ’ a 31 a 13 a 32 a 23 a 21 a 12 a 33 a 22 q 2 q 1 q 3 a 11 a 22 ∪ a 23 a 33 * a 32 a 21 ∪ a 23 a 33 * a 31 a 12 ∪ a 13 a 33 * a 32...
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