Search for tag: "fsm"

CL - 15c - Introducing ε-transitions

We introduce NFA - automata with ε-transitions

From  Haoran Peng on November 23rd, 2020 0 likes 267 plays 0  

CL - 14e - DFA (II)

We look at the representation of DFA in Haskell (using lists to represent the sets of the formal definition).In this video the code isDFA is defining what counts as a DFA when we use the black-hole…

From  Haoran Peng on November 20th, 2020 0 likes 162 plays 0  

CL - 14b - Machines in Haskell (II)

In this video we present the formalisation of the accepts function in Haskell.In this video we use lists to represent the sets used in the mathematical definition. In the code for tutorials we use…

From  Haoran Peng on November 18th, 2020 0 likes 268 plays 0  

CL - 13c - Machines in Haskell

In this video we formalise the definition of an FSM, describe how a machine and its behaviour may be represented in Haskell.In this video we use lists to represent the sets used in the mathematical…

From  Haoran Peng on November 17th, 2020 0 likes 332 plays 0