
Finite State Automaton Challenges
от43 ₽
Гифт: цена — по стране аккаунта

In this game, we will play with the simplest automaton model, Finite State Automaton, and use it to cope with 80 challenges.
от43 ₽
1 видео · 5 скриншотов
FirstLevel

от43 ₽
Гифт: цена — по стране аккаунта
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 возможности
64-разрядные процессор и операционная система
По жанрам и настроению — то, что берут вместе с этой
Другие игры франшизы
Та же студия — тот же почерк