Here, you have the opportunity to preview all the problems offered by Automata Tutor.
Problem Type
Description
DFA Construction
DFA: ending in "ab"
Words in Regex
0 or 1
Equivalence Classes
Allstar
Regular Expression to epsilon-NFA
RE -> epsNFA
Regex Construction
Odd
NFA Construction
NFA: contains
Grammar Construction
axb
Words in Grammar
CFG: Many axb
Chomsky Normal Form
CFG: Many axb
CYK Algorithm
CFG: Many axb
PDA Construction
an bn
NOTICE: We're diligently working on implementing all functions within the Automata Tutor. While progress is being made, please note that certain features are still in the works, and we hope to have them added soon.