Paper Tayyari

Lecture 7: FA corresponding to finite languages

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

Start mock testMock test shuru karein
DoneHal kiye 0/1
– correctsahi
1.
★ Midterm Spring 2009

"Every finite language can be expressed by FA". This statement is __________.

  1. ATrue
  2. BFalse
  3. CDepends on language
  4. DNone of these

Every finite language is regular, so an FA can be built for it.