Discrete Structures: Finite State Machines, Thompson's Constructions

preview_player
Показать описание
Learn how to use Thompson's Constructions to convert a regular expressions to an NFA, then convert the NFA to a DFA.
Рекомендации по теме