Introduction

In this section we will cover Finite Automata, also called Finite State Machines.

You will already have spent some time learning about sorting & searching with Dr. Davies. In this section we are going to look at how such topics can be modelled mathematically. Each section consists of a short video and is accompanied by a detailed handout.

Learning Outcomes

Upon completion of this section you will be able to

Give the definition of a Finite Automaton/Finite State Machine.
Determine the language accepted/recognised by a finite automaton.
Design simple automata to recognise/accept simple languages.

5.1 Languages

Download handout Section 5.1 Languages

Languages

5.2 Automata

Download handout Section 5.2 Automata

Automata

The material in this section is more advanced than in the earlier mathematics sections so we will not include a quiz this week! If you would like some problems to work on then please get in touch on the discussion board.

5.3 Optional Extra Material

For anyone who would like some more course materials on this topic please download the below file. If you would like still more material then please get in touch. Automata Theory straddles the boundary between mathematics and computer science and is an extremely interesting and useful area.

Automata_Theory.pdf