Question
Which statement correctly describes equivalence of RE and FA?
Select an option. Your answer will be checked instantly.
Correct Answer: C. regular expressions and finite automata describe the same class of regular languages
Explanation:
equivalence of RE and FA is correctly described as regular expressions and finite automata describe the same class of regular languages.
Leave a Reply