Computer Sciences > Gate 2024 Set-2 > Thread
Let 𝑀 be the 5-state NFA with 𝜖-transitions shown in the diagram below.
Which one of the following regular expressions represents the language accepted by 𝑀 ?
A
(00)*⁡ + ⁡1(11)*
B
0*+(1+0(00)*)(11)*
C
(00)* + (1+(00)*)(11)*
D
0+ +1(11)* +0(11)*

Correct : a

Similar Questions

Consider a multi-threaded program with two threads T1 and T2. The threads share two semaphores: s1 (initialized to 1) and s2 (initialized to 0). The threads a...
#842 MCQ
Consider the following expression: 𝑥[𝑖]=(𝑝+𝑟)∗−𝑠[𝑖]+𝑢/𝑤. The following sequence shows the list of triples representing the given expression, with entries mi...
#843 MCQ
Consider an array X that contains n positive integers. A subarray of X is defined to be a sequence of array locations with consecutive indices. The C code...
#844 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......