Register

GO Classes DPP | TOC|DFA

336 views
3 3 votes

Which of the regular expressions given below represents the language accepted by this DFA?

l. $\left(0+101^* 01+10\left(1+010^* 10\right)^* 01\right)^*$

II. $\left(0+1\left(01^* 0\right)^* 1\right)^*$

III. $(0110)^*$

  1. II only
     
  2. I and II only
     
  3. I only
     
  4. III only

2 Answers

1 1 vote
Using the state elimination method:

If u eliminate $q_2$ first and then $q_1$, you'll get II If $u$ eliminates $q_1$ first and then $q_2$, you'll get I So option B is correct
1 flag:
✌ Edit necessary (pratikmishra1200 “Option I can't accept string 0(11)*”)
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | TOC...Next → · GO Classes DPP | TOC...
← Previous in category · GO Classes DPP | TOC...Next in category → · GO Classes DPP | TOC...
Position:
Show:

Related questions

3 3 votes
1 1 answer
292
292 views
GO Classes asked Oct 30, 2025
292 views
GO Classes DPP | TOC|CFL
Consider the following languages. Which of them are context-free?$$L_1:\left\{w \in\{a, b\}^* \mid\right.$$$w$ contains a string of the form $a^n b^n$ as a subsequence, f...
3 3 votes
1 1 answer
280
280 views
GO Classes asked Oct 30, 2025
280 views
GO Classes DPP | TOC|CFL
Which of the following languages are context-free? For any string $s$, let $n_x(s)$ denote the number of occurrences of the symbol $x$ in $s$.$L_1:\left\{w \in\{a, b\}^* ...
3 3 votes
2 2 answers
317
317 views
GO Classes asked Oct 30, 2025
317 views
GO Classes DPP | TOC|GRAMMAR
Consider the following context-free grammar $G$, with the set of variables $\{S, A, C, X, Y\}$, the set of terminal symbols $\{a, b, c\}$, and $S$ as the start variable. ...
3 3 votes
1 1 answer
211
211 views
GO Classes asked Oct 30, 2025
211 views
GO Classes DPP | TOC|GRAMMAR
Consider the following context-free grammar $G$, where $S, X$, and $Y$ are the variables (nonterminals), $a, b$, and $c$ are the terminal symbols, $S$ is the start variab...