Paper Tayyari

Lecture 16: NFA with Null String

MCQs, short and long questions from lecture 16.Lecture 16 ki MCQs, short aur long sawal.

2 MCQs · 2 MCQs from past papers2 MCQs · 2 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/2
– correctsahi
1.
★ Final term past paper

Which of the following statement is true about NFA with Null String?

  1. AInfinite states
  2. BInfinite set of letters
  3. CInfinite set of transitions
  4. DTransition of null string is allowed at any stage

An NFA-Λ may move along Λ-edges without reading input.

2.
★ Midterm Fall 2010

If in an NFA, Λ is allowed to be a label of an edge then that NFA is called ________.

  1. AWill not remain NFA
  2. BNFA with Λ
  3. CNFA with null string
  4. DEither "NFA with null string" OR "NFA with Λ"

Such a machine is called both NFA with null string and NFA with Λ.