Finite automata is an abstract computing device. It is a mathematical model of a system with discrete inputs, outputs, states and a set of transitions from state to state that occurs on input symbols from the alphabet Σ.
The finite automata can be represented in three ways, as given below −
Finite automata is defined as a 5-tuples
M=(Q, Σ, δ,q0,F)
Finite Automata can be represented as follows −
It is a directed graph associated with the vertices of the graph corresponding to the state of finite automata.
An example of transition diagram is given below −
It is basically a tabular representation of the transition function that takes two arguments (a state & a symbol) and returns a value (the ‘next state’).
δ : Q × Σ → Q
In transition table, the following factors are considered −
An example of transition table is as follows −
The transition table is as follows −
The transition function is denoted by δ. The two parameters mentioned below are the passes to this transition function.
The transition function returns a state which can be called as the next state.
δ (current_state, current_input_symbol) = next_state
For example, δ(q0,a)=q1