Your turn to find a repeat
Construct your own fsa and verify that it has the following properties when it accepts:
- If the string on the tape has at least as many symbols as there are number of states, there will always be a repeated state.
- The y portion can always be left out and the resulting string will still be in the language.
- The y portion can be repeated and the resulting string will still be in the language