I'm currently working on this question as part of some homework, it has me stumped.
I'm familiar with finite state automata (FSA), I know how they work and I've read everything I can find on Google, but nothing's helped me come any closer to a solution.
If I don't know the length of the input string, or I'm not searching for a particular pattern, how can I design a machine that will always land on the final state?
I've tried drawing some, but that always end up being a little off.