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 Σ.
Finite automata is defined as a 5-tuples
M=(Q, ∑, δ,q0,F)
Consider the Oyster card barriers at tube stations −
Success − Will only withdraw credit, when a customer enters the gate.
Let us consider an example of the oyster card barriers at the tube stations. So, in order to show whether the transaction is accepted or rejected, let us consider the following input
The accept state for the oyster card barriers at the tube stations is given below −