Lecture No. 08
Dated: 26-10-2024
In a transition graph,1 the strings2 which don't have a complete path from initial state to final state are rejected by transition graph1 meanwhile the ones which do have at least one path are accepted and is part of the language accepted by transition graph1
Every finite automaton3 is a transition graph1 but every transition graph1 may not be a finite automaton.3
The following transition graphs has no final state at all, meaning they do not accepts any strings2
However, the last one is also a finite automaton 3
