What is a Transition in a Automata?
About
In a automata, a Transition is the fact of going from one state to another.
It is represented 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
Transitions are triggered by events (Ex: click, link, …)
Symbol
<math>\delta</math> is the symbol for a transition function