Q5Theory of Computation
Question
2 marks
State Kleene's Theorem.
Answer
Kleene's Theorem relates FA and RE.
Kleene's Theorem states that a language is regular if and only if it can be described by a regular expression, and equivalently, if and only if it is accepted by a finite automaton.