Kleenes theorem states-04899
Kleenes theorem states
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Mid Term - Quiz No.11.
Kleenes theorem states
All representations of a regular language are equivalent.
All representations of a context free language are equivalent.
All representations of a recursive language are equivalent
Finite Automata are less powerful than Pushdown Automata.
