
Finite State Automaton Challenges
from₽43
Gift: the price depends on the account country

In this game, we will play with the simplest automaton model, Finite State Automaton, and use it to cope with 80 challenges.
from₽43
1 video · 5 screenshots
FirstLevel

from₽43
Gift: the price depends on the account country
Automaton is a machine that answers a specific question without human intervention once it is turned on, such as: Whether a + b = c?
In this game, we will use the simplest automaton model, the Finite State Automaton, to cope with 80 challenges. They come from character string manipulation, binary numbers, and daily life. Don't worry if you are unfamiliar with Finite State Automaton; this game contains a tutorial to get started quickly. Also, you can read the following introduction.
Finite State Automaton (FSA) is the simplest automaton type. A finite state automaton consists of several states and transition rules. A transition rule describes when a state transits to another. So, it looks like a metro map. The clients of a finite state automaton are the character strings. It decides which strings are accepted and which strings are rejected. For example, an FSA can accept valid emails, phone numbers, etc. Now, let's dive into the first example:
2 features
Requires a 64-bit processor and operating system
Same genres and mood — what people buy with this one
Other games of the franchise
Same studio, same signature