← Schedule Optimization
DFA Workshop
Build a deterministic finite automaton (DFA) that defines which sequences of cell values the schedule solver allows.
Context
Build DFA
State names are at most 5 characters. START is the start state and can't be removed.
Each cell is the state to move to when a staff member's next cell has that value. Use "-" where the value isn't allowed; unset cells are highlighted.
| Accept | State | NF12 | NF34 | NF56T | OFFN | POST | OFF | MGP |
|---|---|---|---|---|---|---|---|---|
| START |
Preview DFA
Save DFA
Unmet requirements:
- You must name the DFA.
- There must be at least one accepting state.
- You must assign a value to each cell. Invalid transitions should be marked with the null transition "-".