|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
In this video we translate this code for checking a solution described by a function s :: Int -> Int -> Int -> Bool into an expression in our language of Forms.This form uses 729…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|