Formal languages and rule induction (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 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. Formal languages are merely sets of strings over a finite alphabet. I explain how we may define a formal language inductively using axioms and rules, and how we may use rule induction to prove properties that apply to all the strings in the language. 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/current/DiscMath/ Course handout: https://www.cl.cam.ac.uk/teaching/2021/DiscMath/2021-stajano-discmath-handout.pdf My home page: http://stajano.com