In an automata or formal-language problem, which option best represents equivalence of RE and FA?

Correct Answer: D

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

In this course context, equivalence of RE and FA means regular expressions and finite automata describe the same class of regular languages.