Info-Grade

1.  Construct finite state automation (DFA) that starts with 'abb'. 

Solution :
Σ: inputs = {a, b}
          q₀ = initial state
          q₁ = string starts with a
          q₂ = string starts with ab
          q₃ = string starts with abb

Q: set of all states (q_0, q_1, q_2, q_3,qФ)
F: Final State 

    Transition Matrix

Transition Graph

2.  Construct finite state automation (DFA) that starts with 'aab'. 

Solution :
Σ: inputs = {a, b}
          q₀ = initial state
          q₁ = string starts with a
          q₂ = string starts with aa
          q₃ = string starts with aab

Q: set of all states (q_0, q_1, q_2, q_3,qФ)
F: Final State 

    Transition Matrix

Transition Graph

3.  Construct finite state automation (DFA) that starts with 'aba'. 

Solution :
Σ: inputs = {a, b}
          q₀ = initial state
          q₁ = string starts with a
          q₂ = string starts with ab
          q₃ = string starts with aba

Q: set of all states (q_0, q_1, q_2, q_3,qФ)
F: Final State 

    Transition Matrix

Transition Graph

4.  Construct finite state automation (DFA) that starts with ''. 

Solution :
Σ: inputs = {a, b}
          q₀ = initial state
          q₁ = string starts with a
          q₂ = string starts with aa
          q₃ = string starts with aab
          q₄ = string starts with aabb

Q: set of all states (q_0, q_1, q_2, q_3, q_4, qФ)
F: Final State 

    Transition Matrix

Transition Graph