TOPIC: Non-deterministic Finite Automaton (NFA) (6 Questions)

Back

Non-deterministic Finite Automaton (NFA) — Previous Years’ Questions

1. Make an NFA: Strings where the first symbol is pre......
Marks: 4.00 | Exam: 1st Mid | Session: 20-21 | Exam Date: N/A | Teacher: Dr. Md Manjur Ahmed
Solution is Coming!
2. i) Analyze about the "Bad Case for the Subset Cons......
Marks: 8.00 | Exam: 1st Mid | Session: 20-21 | Exam Date: N/A | Teacher: Dr. Md Manjur Ahmed
Solution is Coming!
3. Convert the following NFA to DFA.
Marks: 6.00 | Exam: Final | Session: 19-20 | Exam Date: N/A | Teacher: Dr. Md Manjur Ahmed
Solution is Coming!
4. Construct a NFA for the following: Strings where t......
Marks: 3.00 | Exam: Final | Session: 18-19 | Exam Date: N/A | Teacher: N/A
Solution is Coming!
5. Build an NFA for the following language: L = {w | ......
Marks: 4.00 | Exam: Final | Session: 18-19 | Exam Date: N/A | Teacher: N/A
Solution is Coming!
6. Describe the Advantages & Caveats for NFA.
Marks: 3.00 | Exam: Final | Session: 18-19 | Exam Date: N/A | Teacher: N/A
Solution is Coming!