Question
A student is revising equivalence of RE and FA. Which explanation should be selected?
Select an option. Your answer will be checked instantly.
Correct Answer: A. regular expressions and finite automata describe the same class of regular languages
Explanation:
The suitable explanation is regular expressions and finite automata describe the same class of regular languages.
Leave a Reply