filmov
tv
How to tell if two regexps are equivalent? (Discrete Mathematics: Formal Languages and Automata)
Показать описание
I am a Professor in the Computer Science department at the University of Cambridge. Through this channel I welcome anyone in the world to attend my lectures. This video belongs to a series on Formal Languages and Automata that forms the last part of the Discrete Mathematics course for first year computer scientists.
Given two regular expressions, how can we tell whether they recognize the same language? This is a difficult thing to do in your head but in this short video I explain how the problem can in theory be decided by combining many of the constructions we have seen in recent videos.
Many thanks to those of you who are giving thumbs up to these videos and subscribing to the channel. Your support is greatly appreciated and it causes Youtube to offer this material to more viewers who might like it.
Course web page:
Course handout:
My home page:
Given two regular expressions, how can we tell whether they recognize the same language? This is a difficult thing to do in your head but in this short video I explain how the problem can in theory be decided by combining many of the constructions we have seen in recent videos.
Many thanks to those of you who are giving thumbs up to these videos and subscribing to the channel. Your support is greatly appreciated and it causes Youtube to offer this material to more viewers who might like it.
Course web page:
Course handout:
My home page:
0:03:59
0:00:26
0:12:35
0:00:29
0:00:48
0:05:06
0:08:12
0:01:47
0:00:37
0:00:40
0:07:37
0:04:58
0:01:42
0:01:26
0:00:29
0:09:02
0:00:06
0:04:23
0:04:40
0:00:31
0:00:55
0:12:31
0:06:10
0:05:02