Home > Theory Of Computation > DFA Example : Construct Deterministic Finite Automata (DFA) Start And End With Same Symbol

DFA Example : Construct Deterministic Finite Automata (DFA) Start And End With Same Symbol

Construct Minimal Deterministic Finite Automata9DFA) Start & End With Same Symbol Where Σ={a,b}

 

Conditions – If Your String Is Starting With ‘a’, It Should End With ‘a’ Only.

If Your String Is Starting With ‘b’, It Should End With ‘b’ Only.

 

” ‘Dead State’ Concept Comes When I Say About Start Or End Symbol Or When I Say About ‘Substring’.

 

Language Set

L={a,b,aa,bb,aba,bab,abba,…….} // a is the smallest string and starts & ends with ‘a’ (same symbol)

 

Let’s Create Automata For Small String ‘a’

So That We Convert This NFA(a) To DFA(a)

 

L={a,b,aa,bb,aba,bab,abba,…….}

 

String a & b

String a String b, String aa, String bb…..

String aba,bab,abba

 

NOS=5 // Number Of Strings = 5

 

 

 

Leave a Reply

Secured By miniOrange