In the following table, you can see the status of the implementation for all problems available in Automata Tutor.
All problems that are highlighted in green are already available. Those that are highlighted in yellow-green might
contain bugs, as they have not been tested well yet.
| Priority |
Problem Name |
Implementation Status |
Testing Status |
| 1 |
DFA Construction |
Completed |
Completed |
| 2 |
Regex Construction |
Completed |
Completed |
| 3 |
NFA Construction |
Completed |
Completed |
| 4 |
PDA Construction |
Completed |
Completed |
| 5 |
Grammar Construction |
Completed |
Completed |
| 6 |
Words in Regex |
Completed |
Completed |
| 7 |
Equivalence Classes |
Completed |
Completed |
| 8 |
CYK Algorithm |
Completed |
Completed |
| 9 |
Regex to NFA |
Completed |
Completed |
| 10 |
Words in Grammar |
Completed |
Completed |
| 11 |
Eps-NFA to NFA |
Implemented |
Pending |
| 12 |
While to Turing Machine |
Pending |
Pending |
| 13 |
Chomsky Normal Form |
Completed |
Completed |
| 14 |
Minimization |
Implemented |
Pending |
| 15 |
NFA to DFA |
Implemented |
Pending |
| 16 |
Find Derivation |
Partially Implemented |
Pending |
| 17 |
Language Partition |
Partially Implemented |
Pending |
| 18 |
Petri Net: Invariant |
Pending |
Pending |
| 19 |
Petri Net: Firing Sequence |
Pending |
Pending |
| 20 |
Petri Net: Find Siphon |
Pending |
Pending |
| 21 |
Petri Net: Coverability Graph |
Pending |
Pending |
| 22 |
Petri Net: Reachability Graph |
Pending |
Pending |
| 23 |
Petri Net: Backwards Reachability |
Pending |
Pending |
| 24 |
Petri Net: Bounded Reachability |
Pending |
Pending |
| 25 |
Petri Net: Decide Reachability |
Pending |
Pending |
| 26 |
Petri Net: Marking Unreachability |
Pending |
Pending |
| 27 |
Petri Net: Modify |
Pending |
Pending |
| 28 |
Petri Net: Playground |
Pending |
Pending |
There are a couple of more things that have not been included yet. We will let you know about our plans soon.