UAS TEORI BAHASA AUTOMATA

Mesin MOORE

Mod 6

 Q = {q0, q1, q2, q3, q4, q5}

S = {q0}

∑ = {0, 1}

∆ = {0,1,2,3,4,5}

ƛ (q0) = 0

ƛ (q1) = 1

ƛ (q2) = 2

ƛ (q3) = 3

ƛ (q4) = 4

ƛ (q5) = 5

Ᵹ	0	1
Q0	Q0	Q1
Q1	Q2	Q3
Q2	Q4	Q5
Q3	Q0	Q1
Q4	Q2	Q3
Q5	Q4	Q5

TRANSISI dri angka biner

8 4 2 1

0 0 0 0 = 0 mod 6 = 0

0 0 0 1 = 1 mod 6 = 1

0 0 1 0 = 2 mod 6 = 2                                             

0 0 1 1 = 3 mod 6 = 3

0 1 0 0 = 4 mod 6 = 4

0 1 0 1 = 5 mod 6 = 5

0 1 1 0 = 6 mod 6 = 0

0 1 1 1 = 7 mod 6 = 1

1 0 0 0 = 8 mod 6 = 2

1 0 0 1 = 9 mod 6 = 3

1 0 1 0 = 10 mod 6 = 4

1 0 1 1 = 11 mod 6 = 5

1 1 0 0 = 12 mod 6 = 0

Berikut hasil testing di JFLAP

TERIMA KASIH :)

 

UTS TEORI BAHASA AUTOMATA

FSA ( FINITIE STATE AUTOMATA)

δ	0	1
q0	0	q1
q1	q2	q4
q2	q3	q5,q2
q3	q5	0
q4	q2	q3
q5	q2	0

M= {Q,∑,δ,S,F}

 Q= {q0,q1,q2,q3,q4,q5}

∑= {1,0}

S= {q0}

F= {q5}

Berikut hasil Input JFLAP :

-1110 = accept

-1000 = accept

-1100 = reject

-1101 = accept

-1010 = reject

GRAMMAR

VT={S,A,B,C,D,E}

VN= {a,b}

S= {q3}

P= SàaC , AàbS , BàaD ,  DàaC , BàaA  , AàbB  , CàbE , CàbB , E à 0

Dengan hasil inputan :

- abaab - accept

- bbaabb- reject

- ababaab - accept

- aabb- reject

- abaa - reject

Terima Kasih :))