1.
Which of the following statement is true about NFA with Null String?
- AInfinite states
- BInfinite set of letters
- CInfinite set of transitions
- DTransition of null string is allowed at any stage
An NFA-Λ may move along Λ-edges without reading input.
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
Which of the following statement is true about NFA with Null String?
An NFA-Λ may move along Λ-edges without reading input.
If in an NFA, Λ is allowed to be a label of an edge then that NFA is called ________.
Such a machine is called both NFA with null string and NFA with Λ.
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.