Deterministic Finite Automata implementation

[PAARU]

Can anyone implement a determinisitic finite automata by reading from a text file that looks like this:

q0 q1 q2 q3 (states)
a b (alphabets)
q0 (start state)
q0 q1 q2 (accept states)
f(q0,a)=q1 ( rest are transitions)
f(q0,b)=q1
f(q1,a)=q2
f(q1,b)=q2
f(q2,a)=q2
f(q2,b)=q2
f(q3,a)=q3
f(q3,b)=q3

[helios]

Yes.