If R represents a regular language, which of the following represents the Venn-diagram most correctly?
Correct Answer: B
The given diagram represents the Kleene operation over the Regular Language R in which the final states become the initial and the initial state becomes final.
report Report Error
Select Issue Type
Selected Issue
forum Community Discussion
speaker_notes_off
No discussions yet. Be the first to start!
syncLoading more...
You must be logged in to participate in the discussion.
Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.
Correct Answer: B
The initial state of the DFA constructed from this NFA is the set of all NFA states that are reachable from state 1 by ?-moves; that is, it is the set {1, 2, and 3}. A transition from states1, 2, and 3 by input symbol 0 must follow either the arrow from state 1 to 2, or from state 3 to 4. Also, neither state 2 nor 4 have outgoing ?-moves.
