Lecture No. 09

Dated: 26-10-2024

Consider the string¹ \(abbbabbbabba\).
When you trace the string¹ on the given transition graph,² you will find 3 successful paths.
Hence the string¹ is accepted by the transition graphs²

Generalized Transition Graphs

These are collection of followings:

• Finite number of states with one being initial state and many or none being final states.
• Finite set³ of input letters from which strings¹ can be constructed.
• Directed edges connecting some pair of states labeled with regular expression⁴

References

---

1. Read more about strings. ↩↩↩↩

2. Read more about transition graphs. ↩↩

3. Read more about sets. ↩

4. Read more about regular expressions. ↩