UTS TEORI BAHASA AUTOMATA

 

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