Question
Which statement correctly describes equivalence of RE and FA?
Correct Answer: C
regular expressions and finite automata describe the same class of regular languages
equivalence of RE and FA is correctly described as regular expressions and finite automata describe the same class of regular languages.
equivalence of RE and FA is correctly described as regular expressions and finite automata describe the same class of regular languages.
Leave a Reply