DETERMINISTIC FINITE AUTOMATA (DFA)

What is deterministic finite automata? If for every input symbol of an alphabet there is an exactly one transition from