Distillation Lecture 2 2020 part 3

We construct an NFA for R*; then summarize the algebra of regular expressions.

We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges.

We present a first example of the use of ε-transitions to concstruct new mahines, and pose a problem to be answered in the following video.

We give a second definition of regular language as the languages generated from the empty and singleton languages by the operations of, concatenation, alternation, and iteration.

An automated programme is used to generate the subtitles on this talk. You can remove the subtitles by pressing CC on the bottom toolbar. Igor Carboni Oliveira (Warwick) - Kolmogorov complexity,…

We begin with a short discussion of the history and some applications of FSM. We then introduce Deterministic Finit-state Automata (DFA), and the use of the black hole convention when presenting…

We give a first definition of regular language as a language that is accepted by some FSM.

We introduce some simple finite state machines, and three key ideas of the theory.The first idea is that of the language recognised by a machine. Given an alphabet of symbols, a language is a set…

Review of data import, data types, and classes with a case study involving recoding data

Data types and special values in R