Menu

Non Deterministic Finite Automata Questions

MCQ
21.
An NFA may be converted to a DFA using __________
forum Discussion
MCQ
22.
The subset construction shows that every NFA accepts a __________
forum Discussion
MCQ
23.
Construct a NDFA for the following regular expression.
(a?b)*aba(a?b)*
forum Discussion
MCQ
24.
Which is the application of NFA?
forum Discussion
MCQ
25.
For every NFA a deterministic finite automaton (DFA) can be found that accepts the same language.
forum Discussion
MCQ
26.
Like DFAs, NFAs only recognize regular languages.
forum Discussion
chevron_left BackPage 3 of 3