Equivalence of Two Finite Automata (Example-2) - TOC 11

Equivalence of Two Finite Automata (Example-2) - TOC 11
#gate
#gateexam #coding
#gate2024preparation
• Equivalence of Two Fin...
• Myhill Nerode Theorem ...
Full Playlist : • Computer Science I TOC...
An Automaton is a machine that has a finite number of states. Any Two Automaton is said to be equivalent if both accept exactly the same set of input strings.
Two Automaton are equivalent if they satisfy the following conditions :
1. The initial and final states of both the automatons must be same.
2. Every pair of states chosen is from a different automaton only.
3. While combining the states with the input alphabets, the pair results must be either both final states or intermediate states.(i.e both should lie either in the final state or in the non-final state).
4. If the resultant pair has different types of states, then it will be non-equivalent. (i.e. One lies in the final state and the other lies in the intermediate state ).
#msclassosite