The given NFA corresponds to which of the following Regular expressions?
Correct Answer: A
The transition states shown are the result of breaking down the given regular expression in fragments. For dot operation, we change a state, for union (plus) operation, we diverge into two transitions and for Kleene Operation, we apply a loop.
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.
Let for ?= {0,1} R= (???) *, the language of R would be
Correct Answer: B
This regular expression can be used to eliminate the answers and get the result. The length can be even and as well more than 3 when R= (???) (???) (particular case).
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.
From first part if we take x then from the latter part x then it forms xx
From first part if we take x then from the latter part y then it forms xy
From first part if we take y then from the latter part x then it forms yx
From first part if we take y then from the latter part y then it forms yy.
