Designing finite state automata and testing them with JFLAP is a useful practice for formalizing deterministic combinatorial algorithms with easy design.
Let's start with this video:
The exercise we should do now is the following:
Try to understand the jflap simulation with the automaton described above, what is valid as input.
