1) Use JFLAP to create a DFA Di for the language R over the alphabet 10, 1] that consists of all strings where the number of Os mod 3 equals 0 or 1. That is, if sER, then the number of Os in s is either a multiple of 3 or 1 more than a multiple of 3. You should name each state of Di using letters from the beginning of the alphabet. For example, if your DFA has four states, they should be named A, B, C and D. You can rename a state in JFLAP by right-clicking on it and selecting "Set Name" 2) Next, create A PDA P that accepts the language L of even length palindromes over the alphabet 0, 13. Your PDA should push at most one symbol onto the stack for each transition. You should name each state using letters from the end of the alphabet. For example, if your PDA has four states, they should be named W, X, Y and Z. Hint: You will need to use non-determinism in your solution. 3) Finally, create a PDA P2 for the language Rn L. The states of your PDA will be the cartesian- product of the states of the DFA D1 and the states of the PDA P. You should name the states of the PDA P2 by combining the names of the states of the DFA Di and the PDA P. For example, if the states of D are A and B and the states of P1 are X, Y and Z, then P2 will have states named AX, AY, AZ, BX, BY and BZ. Include all states in your machine, even if they are not reachable from the start state. 1) Use JFLAP to create a DFA Di for the language R over the alphabet 10, 1] that consists of all strings where the number of Os mod 3 equals 0 or 1. That is, if sER, then the number of Os in s is either a multiple of 3 or 1 more than a multiple of 3. You should name each state of Di using letters from the beginning of the alphabet. For example, if your DFA has four states, they should be named A, B, C and D. You can rename a state in JFLAP by right-clicking on it and selecting "Set Name" 2) Next, create A PDA P that accepts the language L of even length palindromes over the alphabet 0, 13. Your PDA should push at most one symbol onto the stack for each transition. You should name each state using letters from the end of the alphabet. For example, if your PDA has four states, they should be named W, X, Y and Z. Hint: You will need to use non-determinism in your solution. 3) Finally, create a PDA P2 for the language Rn L. The states of your PDA will be the cartesian- product of the states of the DFA D1 and the states of the PDA P. You should name the states of the PDA P2 by combining the names of the states of the DFA Di and the PDA P. For example, if the states of D are A and B and the states of P1 are X, Y and Z, then P2 will have states named AX, AY, AZ, BX, BY and BZ. Include all states in your machine, even if they are not reachable from the start state
