Home > Theory Of Computation > String Contain 'abb' As Substring ||String End's With 'abb': Finite Automata Example’s

String Contain 'abb' As Substring ||String End's With 'abb': Finite Automata Example’s

Construct Minimal Deterministic Finite Automata (DFA) String Contain ‘abb’

Σ={a,b}

L={abb,abbab,aabba,bbabb….}

ababba

n+1 are possible states for the string 3,4,5……. String Lengths For Any Substring Problems.

 

Construct Minimal DFA

Σ={a,b}

a) String End’s With abb

L={abb,aabb,aaabb,ababb…..} // Instring Language

 

We Will Convert DFA From NFA

If Question Is ‘ ends with ‘ Dont Use ‘ Dead State(qd)

 

2 thoughts on “String Contain 'abb' As Substring ||String End's With 'abb': Finite Automata Example’s

Leave a Reply