Automata step by step

Deterministic Finite Automaton (DFA):
A deterministic finite state machine or deterministic finite automaton (DFA) is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state. DFAs recognize the set of regular languages and no other languages.
A DFA will take in a string of input symbols. For each input symbol it will then transition to a state given by following a transition function. When the last input symbol has been received it will either accept or reject the string depending on whether the DFA is in an accepting state or a non-accepting state.
Non-Deterministic Finite Automaton (NFA):
A nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. Non-deterministic finite state machines are sometimes studied by the name sub shifts of finite type.
So far, we have discussed a lot of definitions, but still we need to know some more definitions. Don’t be impatience, once you become familiar with all the definitions and terms then it will be very interesting. Don’t forget to read my next Post.