Finite State Automaton Challenges

Automaton is a machine for answering a specific question without human intervention once it is turned on, such as:
1. Whether a + b = c?
2. Does a character string contain "a"?
3. Does a "Maybe we could grab a coffee" mean "I have a crush on you"? (I do not think the automaton for this question has been designed.)

In this game, we will play with the simplest automaton model, Finite State Automaton, and use it to cope with 30 challenges. They come from character string manipulation, binary numbers, and daily life.

Don't worry if you are unfamiliar with Finite State Automaton since this game contains a tutorial to get started quickly.