Home > Theory Of Computation > NFA Example: Consider The NFA M Given Below

# NFA Example: Consider The NFA M Given Below

Consider The NFA M Given Below

Let ‘M’ Be The NFA Obtain From M By Converting All The Non-Final States Into Final States

If L & LBe The Language Accepted  By M And MThen Which Of The Following Statement Is Correct.

a) L=L1

b) L⊂L1

c) L1⊂L

d) L∩L1

e) L∪L1=Σ*

f) None

Before Solving This Problem I’ll Tell Yo What I Explained Before So That You’ll Understand This Problem Easily.

In Previous Problems I Solved I Tried To Take Complement For NFA.

But

Complement For NFA Is Not Possible.

Because

The Language We Get After Giving Complement To DFA, That Is The Complement For The Language DFA.

For Example, There Are Two Languages L& L2

L1              L2

If L11  Is LSo, The Strings In LWill Not Be There In LAnd The Strings In L2Will Not Be There In L1

This Is Called Proper Complement

This Case Will Not Be There In NFA

## Solution:-

Be The The NFA Obtain From M By Converting All The Non-Final States Into Final State

Here Question Is To COnvert Non-Final To Final.

Means All Non-Final States Becomes Final.

## a) L=L1

L1={ε,0………} // String Is Starting With ‘0’

Two Languages Are Same L=LSatisfied

## b) L⊂L1

L={ε,0………}

L1={ε,0………}

If Two Languages Are Same The L Will Be The Subset Of LContains ‘L’

## c) L1⊂L

L={ε,0………}

L1={ε,0………}

Two Languages Are Same, So Obviously LWill Be The Subset Of L

## d) L∩L1=Φ

L={ε,0………}

L1={ε,0………}

Two Languages Are Same, So L And LIs Not Equal To Φ

## e) L∪L1=Σ*

L={ε,0………}

L1={ε,0………}

Σ*=Universal Language

Two Languages Are Same

Two Languages Are Starting With ‘0’ Only But In Universal Language

So This Statement Is False

Wrong

## One thought on “NFA Example: Consider The NFA M Given Below”

1. I simply could not depart your website prior to suggesting that I actually enjoyed the standard information a person provide for your guests? Is going to be back ceaselessly to check up on new posts.