Beginner
Theory of Computation
Q1 / 100
What is a finite automaton (FA)?
Correct! Well done.
Incorrect.
The correct answer is B) An abstract machine with a finite set of states, transitions, and a defined start and accepting states
B
Correct Answer
An abstract machine with a finite set of states, transitions, and a defined start and accepting states
Explanation
A finite automaton (DFA or NFA) has a finite set of states, reads input one symbol at a time, and accepts if it ends in an accepting state. It recognizes regular languages.
Progress
1/100