Kleens theorem states-04698
Kleens 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 Final Term - Quiz No.12.
Kleens theorem states
all representations of a regular language are equivalent
all representations of a context free language are equivalent
there may exist no path for certain string
there may be no final state
