Converting Transition Graphs into Regular Expressions - Solved Examples

Описание к видео Converting Transition Graphs into Regular Expressions - Solved Examples

How do you convert NFA to regex?
Can we convert DFA to regex?
This video presents solved examples for converting a Transition Graph, or NFA, or FA into the equivalent regular expression. Thus, while going through this lecture you will develop the skill to convert any given machine (Transition graph) into the regular expression which defines the same language accepted by the machine.

OUTLINE:
0:00 – Quick review of the algorithm
3:28 - Solved Example 1
23:39 - Important remarks on Solved Example 1
25:02 - Solved Example 2
36:43 - Solved Example 3

CONNECT:
If you enjoyed this video, please like it and subscribe to this channel.

Комментарии

Информация по комментариям в разработке