Home > Theory Of Computation > Construct The Minimal Finite Automata And Find The Number Of States In Following Language

Construct The Minimal Finite Automata And Find The Number Of States In Following Language

Construct The Minimal Finite Automata And Find The Number Of States In Following Language

L={ambn/m≥0,n≥2018}

 

This Is A Interesting Problem.

Given m≥0

n≥2018 // 2018 Is A Big Number, It Becomes Very Big DFA But We Need Minimal DFA.

Σ={a,b}

m≥0 Let n≥1

So My Language Is

L={b,bb,bbb,bbbb…….} // ε Epsilon Is Not There Because m=0,n=0,n=1 means ‘b’

 

i)

 

ii) m≥0,n≥2

So My Language Is

L ={bb,bbb,bbbb….}

By Seeing These Two Diagrams I’m Not Able To Guess How Many No. Of States, I Can Get In DFA For m≥0,n≥2018

Lets Take One More Example.

m=0,n≥3

 

iii) L={bbb,bbbb,bbbbb,…….}

If You Observe (i),(ii),(iii) I’m Increasing The ‘n’ Value The No.Of States For DFA’s Are Increasing 3,4,5….

 

One thought on “Construct The Minimal Finite Automata And Find The Number Of States In Following Language

  1. I was very happy to search out this internet-site.I wanted to thanks for your time for this glorious read!! I undoubtedly enjoying every little little bit of it and I have you bookmarked to take a look at new stuff you blog post.

Leave a Reply