|
We introduce NFA - automata with ε-transitions
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|