Converting regular (Type-3) grammar to a deterministic finite state automaton
As Rick Decker said, the algorithm doesnt guarantee that the conversion from G will yieald a DFA. Therefore I should convert to a NFA and than to the DFA. The howto is here.