Kleene’s Theorem step-by-step example for constructing Regular Expressions from a Non-deterministic Finite State Automata (NFSA)

Kleene’s Theorem proves that any language that can be defined by a Regular Expression (RE), a Finite State Automata (FSA) or a generalized Non-deterministic Finite State Automata (NFSA) can be defined by all three methods.

Using this theorem, below the NFSA is used to define a RE. 

by Michael Lashley