Automata Theory Questions and Answers – Applications of NFA
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Applications of NFA”. 1. Under which of the following operation, NFA is not closed? a) Negation b) Kleene c) Concatenation d) None of the mentioned 2. It is less complex to prove the closure properties over regular languages using: a) NFA b) … Read more