Finite Automaton

The animation illustrates a finite automaton that recognizes strings containing the substring "101" by showing its states and transition rules. It demonstrates this by processing the input "1101" to reach the accepting state, alongside a corresponding transition table.