Discrete Structures: Finite State Machines and Regular Expressions

preview_player
Показать описание
Regular expressions and finite state machines are equivalent. Learn how to transform one into the other.
Рекомендации по теме
Комментарии
Автор

This is awesome, Barry.You do a great job. So clear and simple. I can see that you've summarized into longer lectures, less granular. Also a good idea. Thanks so much.

brunoterkaly