Finite State Automaton Challenges
Tramolly Game · 2023 · Programming, Automation, Puzzle, Casual, Strategy
PC
Mostly Positive73% · 11
Compare prices in Official Stores
Screenshots
About Finite State Automaton Challenges
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:
It has two states: the left state "1," and the right state "2". "1" marked with the green color means the automaton starts here. "2" marked with the blue color means that the automaton accepts the input string only if it stops here and read all characters in the order of the string. Consequently, this automaton is to accept "a" and reject any other string.
Question: try to design an FSA accepting "ab" and an FSA accepting "a" or "b" (abbr., "a|b") on your own (They are two challenges in the game).
\
Traditional finite state automata have only three types of states: begin, accept, and normal. In this game, you can play automata with different states at different levels. The picture below shows an example.
\
The most essential concept of FSA (and other automaton types) is called Non-deterministic. To introduce this concept, here is the second example of an automaton. It accepts all strings (only consisting of 'a' and 'b') ending with 'b':
Run this automaton over "b" in your head: (1) It starts at "1", runs the self-loop of "1", then reads all of "b" as well as stops at "1", so reject "b"; (2) It starts at "1" and transits to "2", then reads all of "b" as well as stops at "2", so accept "b". A non-deterministic finite state automaton (NFA) accepts a string if at least one trace ends at a state marked with the blue color.
Run this automaton over "ab" in your head: (1) It starts at "1", runs the self-loop of "1" twice, then reads all of "ab" as well as stops at "1", so reject "ab"; (2) It starts at "1", run the self-loop of "1" once, and transits to "2", then reads all of "b" as well as stops at "2", so accept "ab."
Non-deterministic is essential because it allows the FSA to guess, which lets us design an automaton naturally (since we, human beings, like to guess) and quickly.
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\
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:
It has two states: the left state "1," and the right state "2". "1" marked with the green color means the automaton starts here. "2" marked with the blue color means that the automaton accepts the input string only if it stops here and read all characters in the order of the string. Consequently, this automaton is to accept "a" and reject any other string.Question: try to design an FSA accepting "ab" and an FSA accepting "a" or "b" (abbr., "a|b") on your own (They are two challenges in the game).
\
Finite State Automaton with Various States\
Traditional finite state automata have only three types of states: begin, accept, and normal. In this game, you can play automata with different states at different levels. The picture below shows an example.
\
Non-deterministic\
The most essential concept of FSA (and other automaton types) is called Non-deterministic. To introduce this concept, here is the second example of an automaton. It accepts all strings (only consisting of 'a' and 'b') ending with 'b':
Run this automaton over "b" in your head: (1) It starts at "1", runs the self-loop of "1", then reads all of "b" as well as stops at "1", so reject "b"; (2) It starts at "1" and transits to "2", then reads all of "b" as well as stops at "2", so accept "b". A non-deterministic finite state automaton (NFA) accepts a string if at least one trace ends at a state marked with the blue color.Run this automaton over "ab" in your head: (1) It starts at "1", runs the self-loop of "1" twice, then reads all of "ab" as well as stops at "1", so reject "ab"; (2) It starts at "1", run the self-loop of "1" once, and transits to "2", then reads all of "b" as well as stops at "2", so accept "ab."
Non-deterministic is essential because it allows the FSA to guess, which lets us design an automaton naturally (since we, human beings, like to guess) and quickly.
What Steam players say
Recent verbatim reviews from Steam — separate from playze.io community reviews below.
It has potential, but 30 challenges is way too few, and for those with basic knowledge of finite automata it will take less than an hour to complete them all. Beyond that, it should be clarified that they are all non-deterministic (NFA), and perhaps in the future it can be divided into different challenges for NFA and DFA. Looking forward to expansion already.12 found this helpful
Tutorial is HEAVILY lacking. Already at level 2, they're done explaining and you get stuck. Also, nodes are numbered. If you delete one and add a new one, the number still counts up. Basics... I for one refunded this immediately. I'm down for a good puzzler. But I absolutely reject a lackluster UI and tutorial. This game is complicated for the wrong reasons (the reasons being a bad editor, a bad UI and a super bad tutorial).6 found this helpful
The game is (as expected by its name) an set of finite state automata exercises. However it has the serious problem of having a bad solution editor that seems to only work with an mouse don't allow to multiselect and move states and sometimes blocks you from adding transitions because the game couldn't find space on the board.5 found this helpful
This game is confusing. And not because State Machines are confusing, it's a question of interface and lack of explanation. The tests should be done by the game itself and not the player having to type in a text box. The author should have researched more about state machine viewers on the internet for inspiration. Anyway, the game has potential.5 found this helpful
Extremely fun little game. Looking forward to the devs adding more challenges. A little pet peeve for aesthetic reasons: I don't know if its intentional, but every time you delete a node and add a new node after that this, the new node has automatically an assigned number of +1 of the deleted node. Say, if you delete a node with assigned number '2', the next node you add has number '3', this results in certain numbers just being skipped.4 found this helpful
Good,
Community reviews
—
0 reviews
Sign in to write a review.
No reviews yet. Be the first to review this game.
