Question
In an automata or formal-language problem, which option best represents equivalence of RE and FA?
Select an option. Your answer will be checked instantly.
Correct Answer: D. regular expressions and finite automata describe the same class of regular languages
Explanation:
In this course context, equivalence of RE and FA means regular expressions and finite automata describe the same class of regular languages.
Leave a Reply