A machine is represented by states Q, input alphabet Σ, transition function δ. Initial state q_o and final state F. The machine accepts all the strings over Σ = {a,b}, which starts and ended with any combination of all alphabet and abb works/lies in all the strings to be accepted