Example 2: Automata N2

Q – {q0, q1, q2}

Σ – {a,b}
ẟ-
a B
q0 {q1} {q2}
q1 {q2} e
q2 e {q0}
Q0 – {q0}
F – {q0}

L = {w | w has even length of aas, bbs or both or empty} L =

{w | w has aas only or bbs only or both, or is empty}
L(N2) = {w | w contains aa or bb as a substring} – aa, aabb, bbaa, bbbb, aaaabbbbaa

Input: aa – Accept String Input: aabb – Accept String Input String – bbaa – Accept String

Input: bbbb – Accept String Input String: aaaabbbbaa – Accept String

Example 3: Automata N3

Q – {q0,q1,q2}
Σ – {a,b,c}
ẟ-

a b c
q0 {q1} e e
q1 e {q2} e
q2 e e {q0}

Q0 – {q0}
F – {q0}

Input: aaabc – Reject String Empty String – Accept String Input: abab – Reject String

Accept Strings: abc, abca, abcabc

Reject Strings: aaa, abbb, ababababa
Example 4: Automata N4
Q – {q0,q1,q2,q3,q4,q5}
Σ – {a}
ẟ-
a ε
q0 e {q1,q2}
q1 {q3} e
q2 {q4} e
q3 {q1} e
q4 {q5} e
q4 {q2} e

Q0 – {q0}
F – {q1,q2}

Input: ε - Input: aa Input: aaaa Input: aaaaa