It has a start and an end state and there are only a finite number of states
An automaton implementing a lexer modeling the recognition of the keyword then
- the state (circle) represents a different position in the word then that has been reached so far that ranges from:
- the empty string (ie nothing)
- to the complete word
- Process - LifeCycle (Entity State) (Status) Software for verifying systems of all types that have a finite number of distinct states
- A finite automata model electronic circuits.
example: A on/off button