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: For each string s in a language L , j i i a a a s 1 and i j j R a a a s 1 . The reverse is defined as L s s L R R : . Thus, the NFA for L R would have the same states as the NFA for L , but would have the direction of the transitions reversed and the initial state and accepting state would be swapped. becomes: For a language L , with alphabet , the complement L L * . Thus, the NFA for L will accept everything the NFA for L rejects, and vice versa. becomes: q i q j q i q j q j q i q j q i...
View Full Document
This homework help was uploaded on 04/07/2008 for the course CSCI 2400 taught by Professor Carothers during the Spring '08 term at Rensselaer Polytechnic Institute.
- Spring '08