Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations.

This video looks at the ordering of predicates. We first met thsis as the satisfaction ordering a ⊨ b.We look at the ordering of the 16 possible boolean functions of two variables. We can also view…

First we see how to express the rules of Sudoku in Haskell. Given a total function s :: Int -> Int -> Int -> Bool that represents the way a sudoku puzzle is filled in by saying that s i j k…

VISS online seminar series Orthogonal Polynomials and Random Matrices Walter Van Assche (KU Leuven) 28 October 2020 An automated programme is used to generate the subtitles on this talk. You can…

This video shows how to use a Karnaugh map to represent an arbitrary Boolean function of four variables as a conjunctive normal form (CNF) — a conjunction of disjunctions of literals.

This video shows how blocks of zeros, which correspond to disjund=ctions of literals, lead us to conjunctive normal form (CNF) which we met earlier as the output of our reduction procedure. CNF is in…

This video shows you how to find your way through the state space represented by a Karnaugh Map, and introduces features called blocks. In this video we focus on blocks of ones.

We use the rules to reduce a sequent to a conjunction of simpler sequents. In this example we find that the expression asserted by the sequent is a tautology — it is equivalent to the empty…

What makes data tidy and why do we care?

Research Methods & Statistics 2 (20-21) Week 3 Lecture 5

Research Methods & Statistics 2 (20-21) Week 1 Preliminaries: Functions & Models

Data Analysis in Psychology in R 2, 2020/21.Week 1Lecture 4

Lecture 6a - Reliability by Prof Ian Underwood