This preview shows page 1. Sign up to view the full content.
Unformatted text preview: in another 0, it will go to the accepting state R4 that accepts more characters if needed, and sends them back to R2 (if we get a 0) or R3 (if we get a 1). If R1 takes a 1, then it will go to R3. If it takes in another 1, it will go to the accepting state R4. 2. {w  the length of w is odd} R1 0R2  1R2 R2 0R1  1R1ε R1 is our starting state. If it takes in a 0 or 1, it will go to the accepting state R2. If we receive another symbol, then we have an even amount of letters so we go back to R1 until we get another letter that will send us back to R2 3. {w  w = wR, that is, w is a palindrome} R0 0  1  R1 R1 0R00 1R01 ε R0 is out starting state. If it takes one symbol, then it is good. Otherwise we go into R1. That will make it an accepting string, or it...
View
Full
Document
This note was uploaded on 11/29/2010 for the course CSC 873569 taught by Professor Roberts during the Spring '10 term at ASU.
 Spring '10
 Roberts

Click to edit the document details