A Language that is finite but not regular-04737
A Language that is finite but not regular
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.16.
A Language that is finite but not regular
Λ
(a+b)*
All strings of a's in Σ = {a,.b}
Φ
