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

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.

In this video we look at another example, then consider graphs with a cycle of implications. If we have cycles of implications, then all nodes in the cycle must take the same truth value.

In this video we focus on binary constraints: clauses with two literals. A 2-SAT problem is a conjunction of binary constraints. We will represent it as a partial ordering on literals.In this video…

Sudoku is just a game, but it a good, accessible example of a type of problem that of great practical significance. Here we discuss the Sudoku problem within this wider context.

Dapr1 Lect7_1

This video is a brief recap of most of the logic we have covered so far. You may find it useful, to jog your memory and check your understanding.

This video introduces the key idea behind the DLPP algorithm. If we decide to make some literal true, we may reduce the problem to a simpler problem. We will build our DPLL algorithm by using this…

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…

This video includes a couple of points from a 2019 review lecture on Sequents.First we discuss how to use reduction to find an inhabited model in which Γ ⊨ Δ, which is equivalent to…

The Careers Service takes a look at the current job market for graduates.

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.

Effective Global Carbon MarketsNetworked Emissions Trading Using Disruptive TechnologiesAuthor: Justin D Macinante, Edinburgh Law SchoolHosted by Navraj Singh Ghaleigh, Edinburgh Law School…

We derive the implication rule using the rules introduced last week.

In week 4 we introduced Gentzen's sequents.You should make sure you understand when a sequent is valid, and what it means to provide a counter-example to a sequent -- a universe in which the…