closed by
1,410 views
1 votes
1 votes
closed as a duplicate of: GATE CSE 2023 | Question: 4

Consider the following finite automata and find the correct regular expression.

  1. $0(0+11)^*$
  2. $1(0+11)^*$
  3. $1(0 * 11)^*$
  4. $0\left(0^* 11\right)^*$
closed by

2 Answers

1 votes
1 votes
The given finite automata generate string like $(1,10,111,110,11111,1011,1110,10000,101111,10011...\infty)$ .

Start with $1$ to reach the final state.after that we have $2$ choices as $(0+11)^*$.

$\therefore $ R.E.= $1(0+11)^*$
Option (B) is correct.
edited by
Answer:

Related questions

0 votes
0 votes
2 answers
2
GO Classes asked Feb 5, 2023
3,979 views
Let $f(x)=x^3+15 x^2-33 x-36$ be a real valued function. Which statement is/are TRUE?$f(x)$ has a local maximum.$f(x)$ does NOT have a local maximum.$f(x)$ has a local mi...
4 votes
4 votes
2 answers
3