Interactive Exercises

Your Progress

Overall Progress

15% Complete

Total Score

0 points

Multiple Choice

String Recognition

Fill-in-the-Blank

DFA Minimization

Ordering

Question 1 of 5

Difficulty:Easy

Which of the following is true about deterministic finite automata (DFA)?

A DFA can have multiple transitions for the same input symbol from a state
A DFA can have ε-transitions
A DFA must have exactly one transition for each input symbol from each state
A DFA can be in multiple states simultaneously