1.
"Every finite language can be expressed by FA". This statement is __________.
- ATrue
- BFalse
- CDepends on language
- DNone of these
Every finite language is regular, so an FA can be built for it.
MCQs, short and long questions from lecture 7.Lecture 7 ki MCQs, short aur long sawal.
1 MCQ · 1 MCQ from past papers1 MCQ · 1 MCQ past papers se
"Every finite language can be expressed by FA". This statement is __________.
Every finite language is regular, so an FA can be built for it.
No MCQs match this filter.Is filter mein koi MCQ nahi.
No short questions added yet.Abhi koi short sawal shamil nahi.
No long questions added yet.Abhi koi long sawal shamil nahi.