@Bikram sir my doubt is how to complement this ?

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+17 votes

The regular expression for the language recognized by the finite state automaton of figure is ______

+28 votes

Best answer

Using Arden's theoram to find the regular expression :

A = ε** **+** **A0** **= ε0*** **= $0^*$

$B = A1 + B1 = 0^*1 +B1 = 0^*11^* $

As there are two final states, we should union both RE.

$=0^∗+0^∗11^∗=0∗(e+11^∗)=0^∗(e+1+)=0^∗1^∗=0∗+0^∗11^∗=0^∗(e+11^∗)=0^∗(e+1^+)=0^∗1^∗ $

Note that $e+1^+=1^∗$

PS : Ardens theoram - Let P and Q be two regular expressions. If P does not contain null string, then R = Q + RP has a unique solution that is R = QP*

$L=0^*1^*$

$L$ contains all binary strings where any $1$ is not followed by any $0$.

+10

@gatemate u right R.E for each final state and apply in b/w '+' mans OR then u got 0*+0*11* then take common 0*(epsilion+11*) ans as we know (epsilon+rr*)=r* so here we get 0*1*

0 votes

Clearly , looking into DFA we can say that C is Dead state.

Using Arden's theoram to find the regular expression :

A = ε** **+** **A0** = **ε0*** = **0*

B = A1 + B1 = 0*1 +B1 = 0*11* = 0*1*

Therefore answer is 0*1*

PS : Ardens theoram -

Let P and Q be two regular expressions.

If P does not contain null string, then R = Q + RP has a unique solution that is R = QP*

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 6.9k
- Digital Logic 2.7k
- Programming & DS 4.8k
- Algorithms 4.1k
- Theory of Computation 5.2k
- Compiler Design 2k
- Databases 3.9k
- CO & Architecture 3.4k
- Computer Networks 3.9k
- Non GATE 1.4k
- Others 1.5k
- Admissions 516
- Exam Queries 525
- Tier 1 Placement Questions 23
- Job Queries 67
- Projects 18

46,966 questions

51,289 answers

177,259 comments

66,643 users