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.
A language can be generated from simple primitive language in a simple way if and only if
Correct Answer: B
A language is regular if and only if it can be accepted by a finite automaton. Secondly, It supports no concept of auxiliary memory as it loses the data as soon as the device is shut down.
Consider the following two statements:S1: { 0^2n |n >= l} is a regu1ar language S2: { 0^m 0^n 0^(m+n) l m >= 1 and n >= 2} is a regu1ar languageWhich of the following is true?
Correct Answer: C
S1 can be written as (00) ^n where n >= 1. And S2 can be written as (00) ^ (m+n) where m >=2 and n >= 1. S2 can be further reduced to (00) ^x where x >= 3. SO we can write regular grammars for both
G1 -> G100/00 (For S1)
G2 -> G200/000000 (For S2).
Which of the following does not represents the given language? Language: {0,01}
Correct Answer: D
The given option represents {0, 01} in different forms using set operations and Regular Expressions. The operator like ^, v, etc. are logical operation and they form invalid regular expressions when used.
