Regular Expression Matching (Discrete Mathematics: Formal Languages and Automata)

Опубликовано: 09 Январь 2021
на канале: Frank Stajano Explains

1,140

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 is the first video in a series on Formal Languages and Automata that forms the last part of the Discrete Mathematics course for first year computer scientists.

We introduce the concrete and abstract syntax for regular expressions, the former consisting of strings and the second of trees. We point out subtleties and ambiguities of interpretation over commonly used but ultimately arbitrary conventions regarding operator precedence and associativity.

We define regular expression matching using inductive rules and we ask four general questions that this part of the course will want to answer.

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:
https://www.cl.cam.ac.uk/teaching/cur...

Course handout:
https://www.cl.cam.ac.uk/teaching/202...

My home page:
http://frank.stajano.com