GATE CSE 2023 | Memory Based Question: 25 [closed]

Answer 1

Detailed Video Solution: DFA to Regular Expression question: 1(0+11)*

$\color{\red}{\text{ALL Theory of Computation Questions:}}$

Question 1: PDA Push Down Automata Question

Question 2: Context Free Grammar But Language Regular

Question 3: Number of States in the Minimal DFA

Question 4: Intersection Closure Property based Question

Answer 2

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.