The examples as mentioned: pig = igpsy, latin = atinlay

5. (Igpay Atinlay.) Pig Latin is a simple language transformation that is popular among children, at least in the U.S. It involves rotating words, as in the example above. For this problem you are to investigate a simplified form of it. We'll consider the alphabet (a, b. Any string has a prefix, possibly empty, consisting only of a's. Such a prefix will be called an a-prefix a) Explain why every string has a unique factorization as zw, where z is the maximal a-prefX. b) Let PL(zu) = wz, where w, z are as in a). Can a Moore machine compute PL? c) Same question, but now consider Mealy machines 5. (Igpay Atinlay.) Pig Latin is a simple language transformation that is popular among children, at least in the U.S. It involves rotating words, as in the example above. For this problem you are to investigate a simplified form of it. We'll consider the alphabet (a, b. Any string has a prefix, possibly empty, consisting only of a's. Such a prefix will be called an a-prefix a) Explain why every string has a unique factorization as zw, where z is the maximal a-prefX. b) Let PL(zu) = wz, where w, z are as in a). Can a Moore machine compute PL? c) Same question, but now consider Mealy machines