Automata - Finite Automata (State)

> Automata

1 - About

a finite automaton has a set of states and its control moves from state to state in response to external inputs.

It has As a start and an end state and there are only a finite number of states


3 - Definition

A formal de definition of a finite automaton is whenever:

  • an input X is received by an automaton,
  • the automaton must follow an arc labeled X from the state it is in to some new state (for all states)

3.1 - Class

4 - Example

5 - Implementation

The advantage of having only a finite number of states is that we can implement the system with a fixed set of resources


  • Hardware: we could implement it in hardware as a circuit
  • Software: to make the decision
    • looking at the state
    • or using the position in the code itself

5.1 - Model

example: A on/off button

6 - Documentation / Reference