Paper Tayyari

Lecture 15: Nondeterministic Finite Automaton (NFA)

MCQs, short and long questions from lecture 15.Lecture 15 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

In NFA, there may be more than one transition for certain letters and there may not be any transition for certain letters. This statement is ______________.

  1. AFalse
  2. BTrue
  3. CDepends on language
  4. DNone of the given

This freedom is what makes an NFA nondeterministic.