Finite State Automaton Challenges · published
In this update, we mainly add a new gameplay (Automaton with various states) and a more complete tutorial.
Traditional finite state automata only have three types of states: begin, accept, and normal.
From now on, we will have various state types for different levels. The below picture shows an example.

In this example, states 2, 3, and 4 are used to accept "a," "b," and "c," respectively.
Now, we have a more complete tutorial. This tutorial begins by introducing the basic concepts of finite state automata, such as characters and strings.
The picture below shows a multiple-choice question about the characters from this tutorial.

Like Finite State Automaton Challenges 2, we now have a reset button, which allows players to directly delete all states. The picture below shows this function.
