Σ= is the alphabet (of the input symbols)
Q=is a finite set of states.
δ= s the transition function where δ: Q x Σ -> Q
S ε Q -> Start states (it s must one states)
F ⊆ Q -> Final states (it s mustn’t one states)
a regular language can represent more than one dfa, while each dfa can represent only one regular language. In the same sense, every nfa is not a dfa, even though every dfa is a nfa at the same time
the start states is indicated by a star.
the states are shown in a circle.
The states is indicated by the transition arrows.
the end states is enclosed in double round.
The starting point can only be one and two state departures from a state can not be defined.
Q={s, p,q} Σ={0,1} S=S F={q}
Refers to the double line end.
Exm-> (S,110101)|—(S,10101)|—(S,0101)|—(P-101)|—(P,01)|—(q,1)|—(q, ε) Accept
(S,11011)|—(S,1011)|—(S,011)|—(P,11)|—(P,1)|—(P, ε) Reject