The sate transition function is good for computers while human find the state diagram more comfortable. Trying to understand the language of a machine through its state transition function is very difficult. Let's create FA which accepts strings starting with 'aa'ДЇinite automaton can also be represented graphically to easily understand what is going on. О” (Transition Function): the rules which specify the next state. ОЈ(Alphabet): all possible symbols for an input.

Methamatical RepresentationДЄ finite automaton is mathematically represented by Different events change the state of the airplane safety control, which might either result into an accepting state (allowing to start the engine and takeoff) or a rejecting state if the airplane is not in a condition for a safe flight. It tracks the state of the airplane, like fuel, doors open, fins operating etc. Also vice versa.ДЄ simple fa example is that of airplane safety control.

Hence a finite automaton is designed to result in an accepting state if the input lies in the language (set of strings) we want to recognize. In other words, if the current/active state of a machine after the input given ends, is an accepting state the input is known to be accepted and vice versa. After the input sequence ends the current state of the machine determines whether the input is accepted or rejected based on the type of the state. It takes a sequence of input and changes its current state pointer according to the rules of the machine known as the state function.

FA accepts or rejects an input based on already defined set of strings known as the language of the automaton.ДЄ finite automaton/machine has a finite number of states where a state can either be an accepting state or rejecting state. Finite automaton is a machine used to recognize patterns.

Finite state automata language