A student is revising equivalence of RE and FA. Which explanation should be selected?

Correct Answer: A

regular expressions and finite automata describe the same class of regular languages

The suitable explanation is regular expressions and finite automata describe the same class of regular languages.