Community
Finite State Automaton Challenges 2 is coming!
Finite State Automaton Challenges · published
In the second episode, you will play with the simplest automaton model, Finite State Automaton, and use it to cope with 40 challenges from variants of the previous episode, character string manipulation, computer science, and mathematics.
We're making the game even more challenging and fun by introducing two major updates:
- A state can be both beginning and accepting.
- Some challenges require you to create a deterministic automaton (thanks for the suggestions from players), which means:
- There is at most one begin state.
- Empty edges are not allowed, i.e., each edge must contain at least one character.
- For a character, a state can transit to at most one state, i.e., no conflict edges.
More from Finite State Automaton Challenges
Other announcements
v1.3 is out!We add ten game levels, mainly about traffic lights and stocks.v1.2 (a major update) is out!In this update, we mainly add a new gameplay (Automaton with various states) and a more complete tutorial. Automaton with Various States 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…v1.1 is out!We make the following updates: · add ten more levels. · inherit the UI of finite state automation challenges 2. · arrange levels by their fields, such as Mathematics and Daily Life, instead of difficulties. · fix errors in level descriptions (Thanks to our players).