### Solved Examples

NFA

1. Construct NFA with its transition graph and transition table for the Regular expression
(a| b)* abb

Transition graph

Transition table

 a b ϵ A {A,B} {A} ø B ø {C} ø C ø {D} ø D* ø ø ø
1. Construct NFA with its transition graph and transition table for the language that accepts a set of all strings that ends with 1.
Here , Σ= {0,1}
RE=(0 |1)*1

Transition graph

Transition table

 0 1 ϵ A {A} {A , B} ø B* ø ø ø
1. Construct the NFA for the language that accepts a set of all strings that starts with 11.
Here , Σ= {0,1}
RE= 1 1 (0 |1) *

Transition graph

Transition table

 0 1 ϵ A ø {B} ø B ø {C} ø C* {C} {C} ø
1. Construct NFA with its transition graph and transition table for the language that accepts a set of all binary strings of length 2
Here , Σ= {0,1}
RE=(0 |1) (0|1)

Transition graph

Transition table

 0 1 ϵ A {B} {B} ø B {C} {C} ø C* ø ø ø
1. Construct NFA with its transition graph and transition table for the language that accepts a set of all binary strings that ends with 00 or 11.
Here , Σ= {0,1}
RE=(0 |1)*(00|11)

Transition graph

Transition table

 0 1 ϵ A {A, D} {A,B} ø B ø {C} ø C ø ø ø D {E} ø ø E* ø ø ø