In the second episode, you will play with the simplest automaton model, Finite State Automaton, and use it to cope with 40 challenges from variants of the previous episode, character string manipulation, computer science, and mathematics.
We're making the game even more challenging and fun by introducing two major updates:
- A state can be both beginning and accepting.
- Some challenges require you to create a deterministic automaton (thanks for the suggestions from players), which means:
- There is at most one begin state.
- Empty edges are not allowed, i.e., each edge must contain at least one character.
- For a character, a state can transit to at most one state, i.e., no conflict edges.