Automaton Repres‐
entation
M=(Q,Σ,δ,q0,F)
Q: Set of states {q0,q1,q2}
Σ: input alphabet {a,b} & ε ∉ Σ
δ: transition
function
δ(q,x)=q'
q0: initial state
F: set of accepting
states
{q2}
Language of
Automaton
L(M)={ w∈Σ* : δ*
(q0,w)∈F}
Sorry about this, but Cheatography is only able to provide the resources it does thanks to revenue from advertising. Please consider disabling your ad blocker before continuing.