Tugas Teori Bahasa & Automata, Finite State Automata (FSA)

        diagram

M = ( Q, ∑, δ, S, F )

Q = { A, B, C, D, E }

∑ = { a, b, c, d, e, f }

S = A

F = { A, C, D }

Tabel Transisi

δ	a	b	c	d	e	f
A	C	B	0	0	0	0
B	E	0	D	E	0	0
C	0	0	D	E	D	E
D	0	0	0	0	0	0
E	0	0	0	0	0	0

Inputan yang diterima

- bc, a, ac, ae

1. δ (A, bc) => δ (B, c) => D (Diterima)
2. δ (A, a) => C (Diterima)
3. δ (A, ac) => δ (C, c) => D (Diterima)
4. δ (A, ae) => δ (C, e) => D (Diterima)

Inputan yang ditolak

- b, ad, af, ba, bd

1. δ (A, b) => B (Ditolak)
2. δ (A, ad) => δ (C, d) => E (Ditolak)
3. δ (A, af) => δ (C, f) => E (Ditolak)
4. δ (A, ba) => δ (B, a) => E (Ditolak)
5. δ (A, bd) => δ (B, d) => E (Ditolak)