| | |
Summary: Theory of Computation
Lecture 3: Finite Automata
Max Alekseyev
University of South Carolina
January 17, 2012
Lecture Outline
Finite Automata
Formal Definition
DFA Computation
Regular Operations
Finite Automata
The finite state machine or finite automaton is the simplest
computational model of limited memory computers.
Example: an automatic door opener at a supermarket decides
when to open or close the door, depending on the input provided
by its sensors.
Finite Automata
The finite state machine or finite automaton is the simplest
computational model of limited memory computers.
Example: an automatic door opener at a supermarket decides
|
