- Q is a finite set of
*states,* - is a finite set of
symbols, the
*input alphabet,* - : Q
Q is a
*transition function,* - q0 Q
is the
*initial state,* - F Q is
a set of
*final states.*

We can also define an *extended transition function*
as

If a DFA M = (Q, , , q0, F) is used as a membership criterion, then the set of strings accepted by M is a language. That is,

Languages that can be defined by dfas are called *regular languages.*

Copyright © 1996 by David Matuszek

Last modified Jan 29, 1996