Home > Theory Of Computation > DFA Example : Construct Minimal FA(MEANS DFA) That Accept All The Strings Of a & b Where Second Symbol From Left End Is a

DFA Example : Construct Minimal FA(MEANS DFA) That Accept All The Strings Of a & b Where Second Symbol From Left End Is a

Construct Minimal FA(MEANS DFA) That Accept All The Strings Of a & b Where Second Symbol From Left End Is a, Third Symbol From Left End Is b, Fifth Symbol From Left End Is a.

2nd From Left End Is a

3rd Symbol From Left End Is b

5th Symbol From Left End Is a

 

Conditions

  • Every Second Symbol From Left End Should Be ‘a'(a,aba,aaa)
  • Every Third Symbol From Left End Should Be ‘b’
  • Every Fifth Symbol From Left End Should Be ‘a’

 

2nd From Left End Is a

3rd Symbol From Left End Is b

L={aab,abb,bab,bbb} // Finite String

DFA

5th Symbol From Left End Is a

 

 

 

 

 

Leave a Reply