# Automata - Transition

### Table of Contents

## About

In a automata, a Transition is the fact of going from one state to another and is represent by a edge in a graph.

It's a function that:

- takes as arguments a state and an input symbol (The transition to perform)
- and returns a state

## Articles Related

## Symbol

<math>\delta</math> is the symbol for a transition function