A language is a subset of the set of all possible strings formed from a given set of symbols.
There must be a membership criterion for determining whether a particular stringin in the set.
A grammar is a formal system for accepting or rejecting strings.
A grammar may be used as the membership criterion for a language.
An automaton is a simplified, formalized model of a computer.
An automaton may be used to compute the membership function for a language.
Automata can also compute other kinds of things.
Deterministic Finite Automata
Deterministic--there is no element of choice
Finite--only a finite number of states and arcs
Acceptors--produce only a yes/no answer A DFA is drawn as a graph, with each
represented by a circle.One designated state is the
.Some states (possibly including the start state) can be designated as
.Arcs between states represent
-- each such arc is labeled with the symbol thattriggers the transition.